Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33. SOFSEM 2007: Harrachov, Czech Republic
- Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plásil:
SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings. Lecture Notes in Computer Science 4362, Springer 2007, ISBN 978-3-540-69506-6
Invited Talks
- Ricardo A. Baeza-Yates:
Graphs from Search Engine Queries. 1-8 - Lubos Brim, Mojmír Kretínský:
Model-Checking Large Finite-State Systems and Beyond. 9-28 - Manfred Broy:
Interaction and Realizability. 29-50 - Yann Chevaleyre, Ulle Endriss
, Jérôme Lang, Nicolas Maudet:
A Short Introduction to Computational Social Choice. 51-69 - Asaf Efrima, David Peleg:
Distributed Models and Algorithms for Mobile Robot Systems. 70-87 - Andrew V. Goldberg:
Point-to-Point Shortest Path Algorithms with Preprocessing. 88-102 - Thomas A. Henzinger:
Games, Time, and Probability: Graph Models for System Design and Analysis. 103-110 - Nicholas R. Jennings:
Agreement Technologies. 111-113 - Bertrand Meyer, Ilinca Ciupa, Andreas Leitner, Lisa Ling Liu:
Automatic Testing of Object-Oriented Software. 114-129 - Heinz W. Schmidt:
Architecture-Based Reasoning About Performability in Component-Based Systems. 130-137 - Remco C. Veltkamp:
Multimedia Retrieval Algorithmics. 138-154
Foundations of Computer Science
- Ruben Agadzanyan, Rusins Freivalds:
Size of Quantum Finite State Transducers. 155-163 - Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta:
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. 164-175 - Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang:
Straightening Drawings of Clustered Hierarchical Graphs. 176-187 - Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman:
Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. 188-199 - Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel:
About the Termination Detection in the Asynchronous Message Passing Model. 200-211 - Raphaël Clifford, Benjamin Sach:
Fast Approximate Point Set Matching for Information Retrieval. 212-223 - Orhan Dagdeviren, Kayhan Erciyes:
A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks. 224-234 - O'Neil Delpratt, Naila Rahman, Rajeev Raman:
Compressed Prefix Sums. 235-247 - Yefim Dinitz, Shay Solomon:
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. 248-259 - Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Kutylowski:
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs. 260-271 - Martin Fürer, Shiva Prasad Kasiviswanathan:
Exact Max 2-Sat: Easier and Faster. 272-283 - Frantisek Galcík, Gabriel Semanisin:
Maximum Finding in the Symmetric Radio Networks with Collision Detection. 284-294 - Gregor Gößler, Susanne Graf, Mila E. Majster-Cederbaum, Moritz Martens, Joseph Sifakis:
An Approach to Modelling and Verification of Component Based Systems. 295-308 - Mika Hirvensalo:
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages. 309-319 - David Janin:
On the (High) Undecidability of Distributed Synthesis Problems. 320-329 - Bastian Katz, Marco Gaertler, Dorothea Wagner:
Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks. 330-341 - Sungwook Kim, Sungchun Kim:
Online Service Management Algorithm for Cellular/WALN Multimedia Networks. 342-346 - Pok-Son Kim, Arne Kutzner:
A Simple Algorithm for Stable Minimum Storage Merging. 347-356 - Sang-Wook Kim, Seok-Ho Yoon, Sang-Cheol Lee, Junghoon Lee, Miyoung Shin:
Generating High Dimensional Data and Query Sets. 357-366 - Joachim Kneis, Daniel Mölle, Peter Rossmanith:
Partial vs. Complete Domination: t-Dominating Set. 367-376 - Vera Kurková:
Estimates of Data Complexity in Neural-Network Learning. 377-387 - Ivan Lanese:
Concurrent and Located Synchronizations in pi-Calculus. 388-399 - Su-Mi Lee, Su Youn Lee, Dong Hoon Lee:
Efficient Group Key Agreement for Dynamic TETRA Networks. 400-409 - Markus Maier, Steffen Mecke, Dorothea Wagner:
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks. 410-421 - Jérôme Monnot, Sophie Toulouse:
The Pk Partition Problem and Related Problems in Bipartite Graphs. 422-433 - Oscar Pedreira, Nieves R. Brisaboa:
Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces. 434-445 - Lukás Petru, Jirí Wiedermann:
A Model of an Amorphous Computer and Its Communication Protocol. 446-455 - Dominique Quadri, Éric Soutif, Pierre Tolla:
A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems. 456-464 - M. Sohel Rahman, Costas S. Iliopoulos:
Indexing Factors with Gaps. 465-474 - Joel Ratsaby:
Information Efficiency. 475-487 - Bala Ravikumar, Nicolae Santean:
Deterministic Simulation of a NFA with k -Symbol Lookahead. 488-497 - Jae-Kwon Seo, Kyung-Geun Lee:
Mobility Management Using Virtual Domain in IPv6-Based Cellular Networks. 498-509 - Heiko Stamer, Friedrich Otto:
Restarting Tree Automata. 510-521 - Jirí Síma, Stanislav Zák:
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. 522-531 - Ladislav Vagner, Borivoj Melichar:
Formal Translation Directed by Parallel LLP Parsing. 532-543 - Hua Wang, Zuquan Ge, Jun Ma:
Self-adaptive Lagrange Relaxation Algorithm for Aggregated Multicast. 544-553 - Qingjun Xiao, Ruonan Rao, Jinyuan You:
A Language for Reliable Service Composition. 554-565 - Xiaoxiao Yang, Zhenhua Duan:
Operational Semantics of Framed Temporal Logic Programs. 566-578 - Harald Zankl, Nao Hirokawa, Aart Middeldorp:
Constraints for Argument Filterings. 579-590
Multi-agent Systems
- Claudio Cubillos, Franco Guidi-Polanco, Ricardo Soto:
Performance Analysis of a Multiagent Architecture for Passenger Transportation. 591-600 - Reza Ebrahimpour, Ehsanollah Kabir, Mohammad Reza Yousefi:
Teacher-Directed Learning with Mixture of Experts for View-Independent Face Recognition. 601-611 - Mi-Young Kang, Omar F. Hamad, Choung-Ung Pom, Ji-Seung Nam:
FTTH-Enhanced Mini-System m TBCP-Based Overlay Construction and Evaluation. 612-623 - Michal P. Karpowicz, Krzysztof Malinowski:
On Efficient Resource Allocation in Communication Networks. 624-635 - Byungryong Kim:
Protecting Agent from Attack in Grid ComputingIII. 636-643 - Javad Safaei, Gholamreza Ghassem-Sani:
Incremental Learning of Planning Operators in Stochastic Domains. 644-655 - Jirí Vokrínek, Jirí Bíba, Jirí Hodík, Jaromír Vybíhal, Michal Pechoucek:
Competitive Contract Net Protocol. 656-668 - Xue Xiao, Zeng Zhifeng, Cui Ying:
Agent Oriented Methodology Construction and Customization with HDA. 669-681
Emerging Web Technologies
- Peter Bartalos, Michal Barla, György Frivolt, Michal Tvarozek, Anton Andrejko, Mária Bieliková, Pavol Návrat:
Building an Ontological Base for Experimental Evaluation of Semantic Web Applications. 682-692 - Heung-Nam Kim, Ae-Ttie Ji, Soon-Geun Lee, GeunSik Jo:
Semantic Web Approach in Designing a Collaborative E-Item Bank System. 693-704 - Deok-Hwan Kim, Jae-Won Song, Ju-Hong Lee:
A Hybrid Region Weighting Approach for Relevance Feedback in Region-Based Image Search on the Web. 705-715 - José Paulo Leal, Marcos Aurélio Domingues:
Rapid Development of Web Interfaces to Heterogeneous Systems. 716-725 - Daesung Lee, Ki-Chang Kim, Year Back Yoo:
Enhancing Security by Embedding Biometric Data in IP Header. 726-737 - Hyunho Lee, Wonsuk Lee:
Runtime-Efficient Approach for Multiple Continuous Filtering in XML Message Brokers. 738-749 - Yong Li, Fangchun Yang, Kai Shuang, Sen Su:
A Semantic Peer-to-Peer Overlay for Web Services Discovery. 750-760 - Sun Park, Ju-Hong Lee, Deok-Hwan Kim, Chan-Min Ahn:
Multi-document Summarization Based on Cluster Using Non-negative Matrix Factorization. 761-770 - Josep Silva:
A Program Slicing Based Method to Filter XML/DTD Documents. 771-782 - Joe Tekli, Richard Chbeir, Kokou Yétongnon:
A Hybrid Approach for XML Similarity. 783-795 - Michal Tvarozek, Michal Barla, Mária Bieliková:
Personalized Presentation in Web-Based Information Systems. 796-807 - Jianyin Zhang, Fangchun Yang, Kai Shuang, Sen Su:
Immune-Inspired Online Method for Service Interactions Detection. 808-818
Dependable Software and Systems
- Xin Chen, Zhiming Liu, Vladimir Mencl:
Separation of Concerns and Consistent Integration in Requirements Modelling. 819-831 - Yunja Choi:
Checking Interaction Consistency in MARMOT Component Refinements. 832-843 - Philippe Collet, Alain Ozanne, Nicolas Rivierre:
Towards a Versatile Contract Model to Organize Behavioral Specifications. 844-855 - Jaroslav Drazan, Vladimir Mencl:
Improved Processing of Textual Use Cases: Deriving Behavior Specifications. 856-868 - Harksoo Kim:
A Dialogue-Based NLIDB System in a Schedule Management Domain. 869-877 - Jai Wug Kim, Jongpil Lee, Heon Young Yeom:
Experimental Assessment of the Practicality of a Fault-Tolerant System. 878-887 - Mila E. Majster-Cederbaum, Moritz Martens, Christoph Minnameier:
A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems. 888-899 - Tomas Matousek, Filip Zavoral:
Extracting Zing Models from C Source Code. 900-910 - Ian D. Peake, Heinz W. Schmidt:
Parameterised Extra-Functional Prediction of Component-Based Control Systems - Industrial Experience. 911-922 - Dietmar Schreiner, Karl M. Göschka:
Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems. 923-934
a service of 
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.
last updated on 2024-04-25 04:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
