Student Research Forum SOFSEM 2009 Wednesday, January 28, 2009.

Slides:

Advertisements

Similar presentations

An Interactive-Voting Based Map Matching Algorithm

Advertisements

An Introduction to the Model Verifier verds Wenhui Zhang September 15 th, 2010.

8/25/2009 Sofya Raskhodnikova Intro to Theory of Computation L ECTURE 1 Theory of Computation Course information Overview of the area Finite Automata Sofya.

Coverage by Directional Sensors Jing Ai and Alhussein A. Abouzeid Dept. of Electrical, Computer and Systems Engineering Rensselaer Polytechnic Institute.

Extracting Semantic Relationships Between Wikipedia Articles Lowell Shayn Hawthorne Suzette Stoutenburg Supervisor: Jugal Kalita University of Colorado.

The Big Picture Chapter 3. We want to examine a given computational problem and see how difficult it is. Then we need to compare problems Problems appear.

SOFSEM – Špindlerův Mlýn, ČR.

XML Query Evaluation Using a –calculus Based Framework Pavel Loupal & Karel Richta, FEL ČVUT Praha

Quantum and probabilistic finite multitape automata Ginta Garkaje and Rusins Freivalds Riga, Latvia.

Bangalore, 2 Feb 2005Probabilistic security protocols 1 CIMPA School on Security Specification and verification of randomized security protocols Lecture.

Course on Probabilistic Methods in Concurrency (Concurrent Languages for Probabilistic Asynchronous Communication) Lecture 1 The pi-calculus and the asynchronous.

January 5, 2015CS21 Lecture 11 CS21 Decidability and Tractability Lecture 1 January 5, 2015.

12. Summary, Trends, Research. © O. Nierstrasz PS — Summary, Trends, Research Roadmap  Summary: —Trends in programming paradigms  Research:...

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2005 Lecture 1 (Part 1) Introduction/Overview Tuesday, 1/25/05.

Automatic Discovery of Technology Trends from Patent Text Youngho Kim, Yingshi Tian, Yoonjae Jeong, Ryu Jihee, Sung-Hyon Myaeng School of Engineering Information.

Detecting Research Topics via the Correlation between Graphs and Texts Yookyung Jo Dept. of Computer Science, Cornell University Carl Lagoze †, and C.

Research on Intelligent Information Systems Himanshu Gupta Michael Kifer Annie Liu C.R. Ramakrishnan I.V. Ramakrishnan Amanda Stent David Warren Anita.

Quantum Automata Formalism. These are general questions related to complexity of quantum algorithms, combinational and sequential.

Aho-Corasick String Matching An Efficient String Matching.

Quickest path and Quickest routing: A dynamic routing method Research Topic: Jiang, XidongMS candidate in computer science at California State University,

12. Summary, Trends, Research. © O. Nierstrasz PS — Summary, Trends, Research Roadmap  Summary: —Trends in programming paradigms  Research:...

CMPT-825 (Natural Language Processing) Presentation on Zipf’s Law & Edit distance with extensions Presented by: Kaustav Mukherjee School of Computing Science,

XML –Query Languages, Extracting from Relational Databases ADVANCED DATABASES Khawaja Mohiuddin Assistant Professor Department of Computer Sciences Bahria.

Tomáš Potužák Department of Computer Science and Engineering Faculty of Applied Sciences University of West Bohemia, Pilsen, Czech Republic 1 Component-based.

Irene Díaz 1, Camino R. Vela 1 1 Computer Science Department. University of Oviedo (SPAIN) s 1.

On the Use of Regular Expressions for Searching Text Charles L.A. Clarke and Gordon V. Cormack Fast Text Searching.

Networking project of CS bachelor students Tiina Niklander, University of Helsinki AMICT 2013, Faculty of Science.

Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.

Ch.2 Part A: Requirements, State Charts EECE **** Embedded System Design.

Computational Thinking The VT Community web site:

CMPS 3223 Theory of Computation Automata, Computability, & Complexity by Elaine Rich ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Slides provided.

Project CC4U2 Setting an Efficient Partnership for Allowing International Student Exchanges: a Difficult Issue Philippe Lahire University of Nice Sophia.

Research Directions for Big Data Graph Analytics John A. Miller, Lakshmish Ramaswamy, Krys J. Kochut and Arash Fard Department of Computer Science University.

1 Theory of Computation 計算理論 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:10 PM, Monday Place: BL 103.

Theory of Computing Lecture 15 MAS 714 Hartmut Klauck.

11 February CdP INRIA Futurs Catuscia Palamidessi INRIA Saclay.

Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.

AUTOMATA THEORY Reference Introduction to Automata Theory Languages and Computation Hopcraft, Ullman and Motwani.

Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.

1 Computer Networking Dr. Mohammad Alhihi Communication and Electronic Engineering Department Philadelphia University Faculty of Engineering.

Application of Graph Separators to the Effcient Division-Free Computation of Determinant Anna Urbańska Institute of Computer Science Warsaw University,

Jaroslav Šnajberk, Tomáš Potužák, Richard Lipka Department of Computer Science and Engineering Faculty of Applied Sciences University of West Bohemia,

Saeid Pashzadeh Jan 2009 Theory of Computation 1.

Massive Data Sets and Information Theory Ziv Bar-Yossef Department of Electrical Engineering Technion.

Welcome July 9, 2005 – Pittsburgh, Pennsylvania, USA W1 - Contexts and Ontologies: Theory, Practice and Applications C&O-2005 Pavel Shvaiko Deborah McGuinness.

Probabilistic Automaton Ashish Srivastava Harshil Pathak.

Leveraging Knowledge Bases for Contextual Entity Exploration Categories Date:2015/09/17 Author:Joonseok Lee, Ariel Fuxman, Bo Zhao, Yuanhua Lv Source:KDD'15.

CSCI 2670 Introduction to Theory of Computing October 13, 2005.

Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 0 Introduction Some slides are in courtesy of Prof.

Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From

CS 154 Formal Languages and Computability February 11 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron.

The Big Picture Chapter 3.

1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 12 Mälardalen University 2007.

The Big Picture Chapter 3. A decision problem is simply a problem for which the answer is yes or no (True or False). A decision procedure answers a decision.

King Faisal University جامعة الملك فيصل Deanship of E-Learning and Distance Education عمادة التعلم الإلكتروني والتعليم عن بعد [ ] 1 جامعة الملك فيصل عمادة.

Organization of Programming Languages Meeting 3 January 15, 2016.

A Probabilistic Quantifier Fuzzification Mechanism: The Model and Its Evaluation for Information Retrieval Felix Díaz-Hemida, David E. Losada, Alberto.

CSCI 2670 Introduction to Theory of Computing

CSCI 2670 Introduction to Theory of Computing

Languages Recognizable by Quantum Finite Automata with cut-point 0

European Symposium on Algorithms – ESA

CSCI 2670 Introduction to Theory of Computing

Chapter 10: Mathematical proofs

Decidable Problems of Regular Languages

Hub Node Detection in Directed Acyclic Graphs

Making Change Coins: 2 and

From: String Generation for Testing Regular Expressions

CS21 Decidability and Tractability

University of Nice Sophia Antipolis

Presentation transcript:

Student Research Forum SOFSEM 2009 Wednesday, January 28, 2009

Student Research Forum Statistics 32 student papers submitted 8 papers accepted in LNCS volume 10 papers accepted for SRF volume Student Research Forum2 SOFSEM 2009

Student Research Forum3 SOFSEM 2009 Session organization 1. „short announcement“ part 2. poster presentation combined with coffee break best student paper competition  Johannes C. Schneider: Unambiguous Erasing Morphisms in Free Monoids  Min Wan and Gianfranco Ciardo: Symbolic Reachability Analysis of Integer Timed Petri Nets best student poster competition

Student Research Forum4 SOFSEM 2009 Student Papers A New Normal Form for Context-Sensitive Grammars  Peter Varga (supervisor: Benedek Nagy / Attila Pethö ) University of Debrecen, Hungary Quantum and Probabilistic Finite Multitape Automata  Ginta Garkāje (supervisor: Rūsiņš Freivalds ) University of Latvia Application of Graph Separators to the Efficient Division-Free Computation of Determinant  Anna Urbanska (supervisor: Wojciech Rytter ) Institute of Computer Science, Warsaw University

Student Research Forum5 SOFSEM 2009 Student Papers (cont.) Languages Recognizable by Quantum Finite Automata with cut-point 0  Lelde Lace and Oksana Scegulnaja-Dubrovska (supervisor: Rūsiņš Freivalds ) University of Latvia A smooth Probabilistic Extension of Concurrent Constraint Programming  Romain Beauxis (supervisor: Catuscia Palamidessi ) LIX COMETE - INRIA Saclay An Efficient Communication Protocol for Distributed Traffic Simulation: Introduction of the Long Step Method  Tomas Potuzak (supervisor: Pavel Herout ) University of West Bohemia

Student Research Forum6 SOFSEM 2009 Student Papers (cont.) XML Query Evaluation Using a –calculus Based Framework  Pavel Loupal (supervisor: Karel Richta ) Faculty of Electrical Engineering, Czech Technical University Extracting Semantic Relationships Between Wikipedia Articles  Lowell Shayn Hawthorne and Suzette Stoutenburg (supervisors: Jugal Kalita ) University of Colorado at Colorado Springs (USA) Acquiring Complex Cross-Ontological Relationships  Suzette Stoutenburg and Justin Gray (supervisor: Jugal Kalita ) University of Colorado at Colorado Springs (USA)

Posters Model Complexity in Learning from High- Dimensional Data  Vera Kurkova Efficient Pattern Matching on Binary Strings  Simone Faro and Thierry Lecroq A Faster Algorithm for the Single Source Shortest Path Problem in the Presence of Few Sources or Destinations of Negative  Simone Faro and Domenico Cantone 7 SOFSEM 2009

Student Research Forum8 SOFSEM 2009 Do not forget to vote for the Best Student Poster One of the Best …