1381 search results - page 122 / 277 » Structural signatures for tree data structures |
ALGORITHMICA
2005
14 years 9 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
VISUALIZATION
1998
IEEE
15 years 2 months ago
1998
IEEE
In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space req...
NBIS
2007
Springer
15 years 4 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
ICANNGA
2007
Springer
15 years 1 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
101
click to vote
FOCS
2009
IEEE
15 years 1 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...