475 search results - page 42 / 95 » Efficient Set Similarity Joins Using Min-prefixes |
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
The results of recent studies on the possibility of spatial localization from panoramic images have shown good prospects for view-based methods. The major advantages of these meth...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...