Sciweavers

5580 search results - page 938 / 1116
» Randomized priority algorithms
Sort
View
WWW
2006
ACM
14 years 10 months ago
Communities from seed sets
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
Reid Andersen, Kevin J. Lang
WWW
2005
ACM
14 years 10 months ago
A framework for determining necessary query set sizes to evaluate web search effectiveness
We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a gi...
Eric C. Jensen, Steven M. Beitzel, Ophir Frieder, ...
ICLP
2009
Springer
14 years 10 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
EUROCRYPT
2009
Springer
14 years 10 months ago
Order-Preserving Symmetric Encryption
We initiate the cryptographic study of order-preserving symmetric encryption (OPE), a primitive suggested in the database community by Agrawal et al. (SIGMOD '04) for allowin...
Alexandra Boldyreva, Nathan Chenette, Younho Lee, ...
CAV
2009
Springer
187views Hardware» more  CAV 2009»
14 years 10 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann