Sciweavers

2736 search results - page 321 / 548
» Indexing uncertain data
Sort
View
SISAP
2008
IEEE
98views Data Mining» more  SISAP 2008»
16 years 26 days ago
On Reinsertions in M-tree
In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from...
Jakub Lokoc, Tomás Skopal
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
16 years 26 days ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
16 years 16 days ago
SAXually Explicit Images: Finding Unusual Shapes
Among the visual features of multimedia content, shape is of particular interest because humans can often recognize objects solely on the basis of shape. Over the past three decad...
Li Wei, Eamonn J. Keogh, Xiaopeng Xi
MIR
2005
ACM
128views Multimedia» more  MIR 2005»
16 years 1 days ago
Content-based image retrieval: approaches and trends of the new age
The last decade has witnessed great interest in research on content-based image retrieval. This has paved the way for a large number of new techniques and systems, and a growing i...
Ritendra Datta, Jia Li, James Ze Wang
CIKM
2005
Springer
16 years 22 hour ago
Optimizing cursor movement in holistic twig joins
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...
Marcus Fontoura, Vanja Josifovski, Eugene J. Sheki...