Sciweavers

1098 search results - page 53 / 220
» Compressed web indexes
Sort
View
CIKM
2005
Springer
15 years 3 months ago
Rotation invariant indexing of shapes and line drawings
We present data representations, distance measures and organizational structures for fast and efficient retrieval of similar shapes in image databases. Using the Hough Transform w...
Michail Vlachos, Zografoula Vagena, Philip S. Yu, ...
TASLP
2008
75views more  TASLP 2008»
14 years 9 months ago
Efficient Index-Based Audio Matching
Given a large audio database of music recordings, the goal of classical audio identification is to identify a particular audio recording by means of a short audio fragment. Even th...
Frank Kurth, Meinard Müller
JCDL
2011
ACM
225views Education» more  JCDL 2011»
14 years 22 days ago
How much of the web is archived?
The Memento Project’s archive access additions to HTTP have enabled development of new web archive access user interfaces. After experiencing this web time travel, the inevitabl...
Scott Ainsworth, Ahmed Alsum, Hany SalahEldeen, Mi...
ALENEX
2007
127views Algorithms» more  ALENEX 2007»
14 years 11 months ago
Intersection in Integer Inverted Indices
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
Peter Sanders, Frederik Transier
VLDB
2004
ACM
118views Database» more  VLDB 2004»
15 years 3 months ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani