Sciweavers

1413 search results - page 84 / 283
» Efficient Learning of Semi-structured Data from Queries
Sort
View
SIGIR
2008
ACM
15 years 6 months ago
Learning to rank with partially-labeled data
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...
Kevin Duh, Katrin Kirchhoff
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 7 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
NIPS
1998
15 years 7 months ago
Learning to Estimate Scenes from Images
We seek the scene interpretation that best explains image data. For example, we may want to infer the projected velocities (scene) which best explain two consecutive image frames ...
William T. Freeman, Egon C. Pasztor
156
Voted
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
15 years 6 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
PVLDB
2008
108views more  PVLDB 2008»
15 years 5 months ago
Sliding-window top-k queries on uncertain streams
Query processing on uncertain data streams has attracted a lot of attentions lately, due to the imprecise nature in the data generated from a variety of streaming applications, su...
Cheqing Jin, Ke Yi, Lei Chen 0002, Jeffrey Xu Yu, ...