986 search results - page 121 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
148
click to vote
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
136
click to vote
COCOON
1999
Springer
15 years 8 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
151
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
132
click to vote
TPDS
1998
15 years 3 months ago
1998
—We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addresse...
173
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...