151 search results - page 11 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
145
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
177
click to vote
DMTCS
2010
15 years 1 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
147
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
127
click to vote
SEFM
2008
IEEE
15 years 10 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
139
click to vote
JGAA
2006
15 years 3 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...