Sciweavers

74 search results - page 13 / 15
» Ranking queries on uncertain data: a probabilistic threshold...
Sort
View
HIM
1997
Springer
162views Multimedia» more  HIM 1997»
13 years 11 months ago
Probabilistic Logical Information Retrieval for Content, Hypertext, and Database Querying
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
Thomas Rölleke, Markus Blömer
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
14 years 7 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
VLDB
2002
ACM
131views Database» more  VLDB 2002»
13 years 7 months ago
ProTDB: Probabilistic Data in XML
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Bas...
Andrew Nierman, H. V. Jagadish
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
12 years 3 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...
ICDE
2007
IEEE
158views Database» more  ICDE 2007»
14 years 8 months ago
Efficient Evaluation of Imprecise Location-Dependent Queries
In location-based services, it is common for a user to issue a query based on his/her current position. One such example is "find the available cabs within two miles of my cu...
Jinchuan Chen, Reynold Cheng