328 search results - page 64 / 66 » An O(log n log log n) space algorithm for undirected st-conn... |
COMPGEOM
2003
ACM
14 years 22 days ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
EDBT
2009
ACM
13 years 10 months ago
2009
ACM
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
CPM
2008
Springer
13 years 9 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
ALENEX
2010
13 years 9 months ago
2010
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...