Sciweavers

1381 search results - page 136 / 277
» Structural signatures for tree data structures
Sort
View
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 5 months ago
On external memory graph traversal
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V...
COMPGEOM
2010
ACM
15 years 9 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
134
Voted
MOBIQUITOUS
2008
IEEE
15 years 10 months ago
How to edit gigabyte XML files on a mobile phone with XAS, RefTrees, and RAXS
The Open Source mobility middleware developed in the Fuego Core project provides a stack for efficient XML processing on limited devices. Its components are a persistent map API, ...
Tancred Lindholm, Jaakko Kangasharju
130
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Language model adaptation using Random Forests
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
Anoop Deoras, Frederick Jelinek, Yi Su
PR
2006
132views more  PR 2006»
15 years 3 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...