Sciweavers

1806 search results - page 163 / 362
» Randomness and halting probabilities
Sort
View
SIGIR
2010
ACM
14 years 2 months ago
Clicked phrase document expansion for sponsored search ad retrieval
We present a document expansion approach that uses Conditional Random Field (CRF) segmentation to automatically extract salient phrases from ad titles. We then supplement the ad d...
Dustin Hillard, Chris Leggetter
FOCS
1992
IEEE
14 years 1 months ago
Proof Verification and Hardness of Approximation Problems
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...
WSC
2007
14 years 15 days ago
Feasibility study of variance reduction in the logistics composite model
The Logistics Composite Model (LCOM) is a stochastic, discrete-event simulation that relies on probabilities and random number generators to model scenarios in a maintenance unit ...
George P. Cole III, Alan W. Johnson, J. O. Miller
OPODIS
2007
13 years 11 months ago
Self-stabilizing and Byzantine-Tolerant Overlay Network
Network overlays have been the subject of intensive research in recent years. The paper presents an overlay structure, S-Fireflies, that is self-stabilizing and is robust against ...
Danny Dolev, Ezra N. Hoch, Robbert van Renesse
DAGSTUHL
2006
13 years 11 months ago
Probabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...
Mark Giesbrecht, George Labahn, Wen-shin Lee