Sciweavers

3105 search results - page 381 / 621
» The Path-Packing Structure of Graphs
Sort
View
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 4 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 11 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
COMPSAC
2008
IEEE
15 years 11 months ago
Framework for Computer-Aided Evolution of Object-Oriented Designs
In this paper, we describe a framework for the computeraided evolution of the designs of object-oriented software systems. Evolution mechanisms are software structures that prepar...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
ISMAR
2008
IEEE
15 years 10 months ago
Dynamic gyroscope fusion in Ubiquitous Tracking environments
Ubiquitous Tracking (Ubitrack) setups, consisting of many previously unknown sensors, offer many possibilities to perform sensor fusion in order to increase robustness and accurac...
Daniel Pustka, Gudrun Klinker
LICS
2008
IEEE
15 years 10 months ago
The Quest for a Logic Capturing PTIME
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
Martin Grohe