Sciweavers

5580 search results - page 197 / 1116
» Randomized priority algorithms
Sort
View
96
Voted
RC
2006
88views more  RC 2006»
15 years 2 months ago
Geometric Constructions with Discretized Random Variables
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
Hans-Peter Schröcker, Johannes Wallner
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 2 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 8 months 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 7 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 7 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