Sciweavers

5153 search results - page 100 / 1031
» Introduction to Randomized Algorithms
Sort
View
ICALP
2004
Springer
15 years 7 months ago
Easily Refutable Subformulas of Large Random 3CNF Formulas
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
Uriel Feige, Eran Ofek
100
Voted
AMC
2007
91views more  AMC 2007»
15 years 2 months ago
Deterministic and random synthesis of discrete chaos
In this paper, two anticontrol algorithms for synthesis of discrete chaos are introduced. In these algorithms, the control parameter of a discrete dynamical system is switched, ei...
Miguel Romera, Michael Small, Marius-F. Danca
124
Voted
JCB
2006
91views more  JCB 2006»
15 years 2 months ago
Reverse Engineering Discrete Dynamical Systems from Data Sets with Random Input Vectors
Recently a new algorithm for reverse engineering of biochemical networks was developed by Laubenbacher and Stigler. It is based on methods from computational algebra and finds mos...
Winfried Just
ICCV
2009
IEEE
15 years 4 days ago
Exploiting uncertainty in random sample consensus
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
WWW
2006
ACM
16 years 3 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