807 search results - page 87 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
107
click to vote
TALG
2010
15 years 2 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
123
click to vote
TVCG
2010
15 years 2 months ago
2010
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
143
Voted
WWW
2004
ACM
16 years 4 months ago
2004
ACM
This paper presents a system for efficient data transformations between XML and relational databases, called XML Data Mediator (XDM). XDM enables the transformation by externalizi...
145
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
145
Voted
SSD
1999
Springer
15 years 8 months ago
1999
Springer
There is an increasing need to integrate spatial index structures into commercial database management systems. In geographic information systems (GIS), huge amounts of information ...