Sciweavers

27 search results - page 2 / 6
» Maintaining Longest Paths Incrementally
Sort
View
DBPL
1997
Springer
87views Database» more  DBPL 1997»
13 years 10 months ago
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
We examine the power of incremental evaluation systems that use an SQL-like language for maintaining recursively-de ned views. We show that recursive queries such as transitive clo...
Leonid Libkin, Limsoon Wong
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 7 months ago
Maintaining Connectivity in Dynamic Multimodal Network Models
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...
Petko Bakalov, Erik G. Hoel, Wee-Liang Heng, Vassi...
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
13 years 11 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
14 years 3 months ago
ACG-Adjacent Constraint Graph for General Floorplans
ACG (Adjacent Constraint Graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG...
Hai Zhou, Jia Wang
MST
2011
200views Hardware» more  MST 2011»
13 years 1 months ago
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
Antonio Fernández Anta, José Luis L&...