Sciweavers

509 search results - page 36 / 102
» Efficient indexing for large scale visual search
Sort
View
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 10 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
SIGIR
2008
ACM
13 years 8 months ago
SpotSigs: robust and efficient near duplicate detection in large web collections
Motivated by our work with political scientists who need to manually analyze large Web archives of news sites, we present SpotSigs, a new algorithm for extracting and matching sig...
Martin Theobald, Jonathan Siddharth, Andreas Paepc...
CIKM
2009
Springer
14 years 1 months ago
Low-cost management of inverted files for online full-text search
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
Giorgos Margaritis, Stergios V. Anastasiadis
BTW
2007
Springer
131views Database» more  BTW 2007»
14 years 25 days ago
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...
Martin Theobald, Ralf Schenkel, Gerhard Weikum
WIDM
2004
ACM
14 years 2 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu