Sciweavers

2309 search results - page 237 / 462
» Using Meta-Structures in Database Design
Sort
View
124
Voted
CVPR
2007
IEEE
16 years 5 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
218
Voted
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
16 years 5 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...
113
Voted
WWW
2004
ACM
16 years 4 months ago
Publishing museum collections on the semantic web: the museumfinland portal
Museum collections contain large amounts of data and semantically rich, mutually interrelated metadata in heterogeneous databases. The publication of museum collections on the web...
Ahti Syreeni, Arttu Valo, Eero Hyvönen, Eetu ...
130
Voted
KDD
2006
ACM
166views Data Mining» more  KDD 2006»
16 years 4 months ago
Anonymizing sequential releases
An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information...
Ke Wang, Benjamin C. M. Fung
194
Voted
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
16 years 3 months ago
Extending autocompletion to tolerate errors
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
Surajit Chaudhuri, Raghav Kaushik