Sciweavers

1441 search results - page 110 / 289
» Multiple instance ranking
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 10 months ago
Minimal probing: supporting expensive predicates for top-k queries
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...
Kevin Chen-Chuan Chang, Seung-won Hwang
ICDM
2008
IEEE
142views Data Mining» more  ICDM 2008»
14 years 4 months ago
Unsupervised Face Annotation by Mining the Web
Searching for images of people is an essential task for image and video search engines. However, current search engines have limited capabilities for this task since they rely on ...
Duy-Dinh Le, Shin'ichi Satoh
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 3 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
14 years 2 months ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya
KR
2010
Springer
14 years 2 months ago
A Correctness Result for Reasoning about One-Dimensional Planning Problems
A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...
Yuxiao Hu, Hector J. Levesque