475 search results - page 48 / 95 » Efficient Set Similarity Joins Using Min-prefixes |
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
ICDE
2010
IEEE
13 years 12 months ago
2010
IEEE
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
IJCV
2006
13 years 7 months ago
2006
This paper conceives of tracking as the developing distinction of a foreground against the background. In this manner, fast changes in the object or background appearance can be de...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...