52 search results - page 4 / 11 » Dynamic shortest paths and transitive closure: Algorithmic t... |
TCS
1998
13 years 7 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
TKDE
2010
13 years 6 months ago
2010
— The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguou...
HIPC
2007
Springer
13 years 11 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
GIS
2002
ACM
13 years 7 months ago
2002
ACM
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...