Sciweavers

7228 search results - page 19 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
WWW
2006
ACM
15 years 10 months ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 1 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
BMCBI
2010
190views more  BMCBI 2010»
14 years 9 months ago
Sample size and statistical power considerations in high-dimensionality data settings: a comparative study of classification alg
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...
Yu Guo, Armin Graber, Robert N. McBurney, Raji Bal...
STOC
2004
ACM
89views Algorithms» more  STOC 2004»
15 years 10 months ago
Hit-and-run from a corner
We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, t...
László Lovász, Santosh Vempal...
ICDAR
2003
IEEE
15 years 2 months ago
Using Character Recognition and Segmentation to Tell Computer from Humans
How do you tell a computer from a human? The situation arises often on the Internet, when online polls are conducted, accounts are requested, undesired email is received, and chat...
Patrice Y. Simard, Richard Szeliski, Josh Benaloh,...