Sciweavers

559 search results - page 29 / 112
» Indexing Weighted-Sequences in Large Databases
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
14 years 7 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...
TASLP
2008
75views more  TASLP 2008»
13 years 7 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
ICDE
1999
IEEE
94views Database» more  ICDE 1999»
14 years 9 months ago
Scalable Trigger Processing
Current database trigger systems have extremely limited scalability. This paper proposes a way to develop a truly scalable trigger system. Scalability to large numbers of trigger...
Eric N. Hanson, Chris Carnes, Lan Huang, Mohan Kon...
ADBIS
2000
Springer
97views Database» more  ADBIS 2000»
14 years 12 hour ago
An Efficient Storage Manager
When dealing with large quantities of clauses, the use of persistent knowledge is inevitable, and indexing methods are essential to answer queries efficiently. We introduce PerKMan...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...