Sciweavers

721 search results - page 50 / 145
» Providing ranked relevant results for web database queries
Sort
View
SIGIR
2012
ACM
13 years 8 months ago
An uncertainty-aware query selection model for evaluation of IR systems
We propose a mathematical framework for query selection as a mechanism for reducing the cost of constructing information retrieval test collections. In particular, our mathematica...
Mehdi Hosseini, Ingemar J. Cox, Natasa Milic-Frayl...
VLDB
2001
ACM
82views Database» more  VLDB 2001»
15 years 10 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
ICCV
2011
IEEE
14 years 6 months ago
Automatic Construction of an Action Video Shot Database using Web Videos
There are a huge number of videos with text tags on the Web nowadays. In this paper, we propose a method of automatically extracting from Web videos video shots corresponding to s...
Do Hang Nga, Keiji Yanai
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
14 years 1 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 6 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