Sciweavers

85 search results - page 10 / 17
» Fast and practical indexing and querying of very large graph...
Sort
View
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
15 years 3 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
JSS
2006
132views more  JSS 2006»
14 years 9 months ago
FMF: Query adaptive melody retrieval system
Recent progress of computer and network technologies makes it possible to store and retrieve a large volume of multimedia data in many applications. In such applications, efficien...
Seungmin Rho, Eenjun Hwang
SIGIR
2012
ACM
13 years 22 hour ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel
PVLDB
2008
126views more  PVLDB 2008»
14 years 9 months ago
Dwarfs in the rearview mirror: how big are they really?
Online-Analytical Processing (OLAP) has been a field of competing technologies for the past ten years. One of the still unsolved challenges of OLAP is how to provide quick respons...
Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz ...
CVPR
1997
IEEE
15 years 11 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe