Sciweavers

5138 search results - page 169 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
16 years 17 days ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 12 months ago
Counting Stable Strategies in Random Evolutionary Games
In this paper we study the notion of the Evolutionary Stable Strategies (ESS) in evolutionary games and we demonstrate their qualitative difference from the Nash Equilibria, by sh...
Spyros C. Kontogiannis, Paul G. Spirakis
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
15 years 11 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
FOCM
2007
76views more  FOCM 2007»
15 years 6 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale
PAMI
1998
103views more  PAMI 1998»
15 years 6 months ago
Synchronous Random Fields and Image Restoration
—We propose a general synchronous model of lattice random fields which could be used similarly to Gibbs distributions in a Bayesian framework for image analysis, leading to algor...
Laurent Younes