Sciweavers

35 search results - page 7 / 7
» Data Cleaning and Query Answering with Matching Dependencies...
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
SIGMOD
2007
ACM
198views Database» more  SIGMOD 2007»
14 years 5 months ago
Addressing diverse user preferences in SQL-query-result navigation
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
Zhiyuan Chen, Tao Li
AIRS
2010
Springer
13 years 2 months ago
Learning to Rank with Supplementary Data
This paper is concerned with a new task of ranking, referred to as "supplementary data assisted ranking", or "supplementary ranking" for short. Different from c...
Wenkui Ding, Tao Qin, Xu-Dong Zhang
EDBT
2009
ACM
116views Database» more  EDBT 2009»
13 years 9 months ago
Ranking objects based on relationships and fixed associations
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
Albert Angel, Surajit Chaudhuri, Gautam Das, Nick ...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
13 years 11 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...