Sciweavers

5785 search results - page 867 / 1157
» Approximability of Probability Distributions
Sort
View
CHI
2009
ACM
16 years 5 months ago
Predicting query reformulation during web searching
This paper reports results from a study in which we automatically classified the query reformulation patterns for 964,780 Web searching sessions (composed of 1,523,072 queries) in...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink
POPL
2007
ACM
16 years 5 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
16 years 5 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 5 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
PODS
2001
ACM
127views Database» more  PODS 2001»
16 years 5 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor