Sciweavers

2996 search results - page 55 / 600
» Numberings and Randomness
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 11 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
SLSFS
2005
Springer
14 years 3 months ago
Random Projection, Margins, Kernels, and Feature-Selection
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as...
Avrim Blum
TIT
2008
87views more  TIT 2008»
13 years 9 months ago
On Correcting Bursts (and Random Errors) in Vector Symbol (n, k) Cyclic Codes
Simple methods are shown for correcting bursts of large size and bursts combined with random errors using vector symbols and primarily vector XOR and feedback shift register operat...
John J. Metzner
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 9 months ago
On the survey-propagation equations for the random K-satisfiability problem
In this note we study the existence of a solution to the survey-propagation equations for the random K-satisfiability problem for a given instance. We conjecture that when the num...
Giorgio Parisi
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
14 years 10 months ago
Tight bounds for asynchronous randomized consensus
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
Hagit Attiya, Keren Censor