default search action
30. SOFSEM 2004: Merin, Czech Republic
- Peter van Emde Boas, Jaroslav Pokorný, Mária Bieliková, Julius Stuller:
SOFSEM 2004: Theory and Practice of Computer Science, 30th Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 24-30, 2004. Lecture Notes in Computer Science 2932, Springer 2004, ISBN 3-540-20779-1
Invited Talks
- H. Jaap van den Herik, H. H. L. M. Donkers:
Games, Theory and Applications. 1-8 - Keith G. Jeffery:
Database Research Issues in a WWW and GRIDs World. 9-21 - V. Kumar:
Integration, Diffusion, and Merging in Information Management Discipline. 22-40 - Peter C. Lockemann, Jens Nimis:
Flexibility through Multiagent Systems: Solution or Illusion? 41-56 - Natasa Milic-Frayling:
World Wide Web Challenges: Supporting Users in Search and Navigation. 57-59 - Dimitris Plexousakis:
Querying and Viewing the Semantic Web: An RDF-Based Perspective. 60-61 - Danuta Rutkowska:
Knowledge Acquisition and Processing: New Methods for Neuro-Fuzzy Systems. 62-81 - Peter Sanders:
Algorithms for Scalable Storage Servers. 82-101 - Ralf Schweimeier, Michael Schroeder:
Fuzzy Unification and Argumentation for Well-Founded Semantics. 102-121 - Pavel Zezula, Federica Mandreoli, Riccardo Martoglia:
Tree Signatures and Unordered XML Pattern Matching. 122-139
Regular Papers
- Aija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace, Oksana Scegulnaja:
Quantum Query Complexity for Some Graph Problems. 140-150 - Mária Bieliková, Ivan Noris:
A Model of Versioned Web Sites. 151-162 - R. Elijah Blessing, V. Rhymend Uthariaraj:
Design of Secure Multicast Models for Mobile Services. 163-173 - Dirk Bongartz:
Some Notes on the Complexity of Protein Similarity Search under mRNA Structure Constraints. 174-183 - George Boukeas, Constantinos Halatsis, Vassilis Zissimopoulos, Panagiotis Stamatopoulos:
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances. 184-195 - Bernadette Charron-Bost, Fabrice Le Fessant:
Validity Conditions in Agreement Problems and Time Complexity. 196-207 - Sergio Miguel Fernandes, João P. Cachopo, António Rito Silva:
Supporting Evolution in Workflow Definition Languages. 208-217 - Michael Forster, Christian Bachmaier:
Clustered Level Planarity. 218-228 - Ladislava Janku:
Artificial Perception: Auditory Decomposition of Mixtures of Environmental Sounds - Combining Information Theoretical and Supervised Pattern Recognition Approaches. 229-240 - Marcel Jirina, Marcel Jirina Jr.:
Features of Neighbors Spaces. 241-248 - Martin Kavalec, Alexander Maedche, Vojtech Svátek:
Discovery of Lexical Entries for Non-taxonomic Relations in Ontology Learning. 249-256 - Matej Makula, Michal Cernanský, Lubica Benusková:
Approaches Based on Markovian Architectural Bias in Recurrent Neural Networks. 257-264 - Tadeusz Pankowski:
Processing XPath Expressions in Relational Databases. 265-276 - J. Guadalupe Ramos, Josep Silva, Germán Vidal:
An Embedded Language Approach to Router Specification in Curry. 277-288 - G. Ravindra, N. Balakrishnan, K. R. Ramakrishnan:
Multi-document Automatic Text Summarization Using Entropy Estimates. 289-300 - Daniel Sawitzki:
Implicit Flow Maximization by Iterative Squaring. 301-313 - Lukás Sekanina:
Evolving Constructors for Infinitely Growing Sorting Networks and Medians. 314-323 - Miguel-Ángel Sicilia-Urbán, Elena García-Barriocanal:
Fuzzy Group Models for Adaptation in Cooperative Information Retrieval Contexts. 324-334 - Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin:
Theory of One Tape Linear Time Turing Machines. 335-348 - Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Avoiding Forbidden Submatrices by Row Deletions. 349-360 - Jirí Wiedermann:
Building a Bridge between Mirror Neurons and Theory of Embodied Cognition. 361-372
The Best Student Paper
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.