Sciweavers

24 search results - page 3 / 5
» Probabilistic Optimization of Top N Queries
Sort
View
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
12 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...
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
13 years 11 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
13 years 11 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
VLDB
2007
ACM
130views Database» more  VLDB 2007»
14 years 6 months ago
A Simple and Efficient Estimation Method for Stream Expression Cardinalities
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
Aiyou Chen, Jin Cao, Tian Bu
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
14 years 6 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