Sciweavers

5580 search results - page 153 / 1116
» Randomized priority algorithms
Sort
View
IWOCA
2009
Springer
133views Algorithms» more  IWOCA 2009»
15 years 4 months ago
The Height and Range of Watermelons without Wall
d abstract) Thomas Feierl⋆ Fakult¨at f¨ur Mathematik Universit¨at Wien Nordbergstr. 15 1090 Wien, Austria Abstract. We determine the weak limit of the distribution of the rand...
Thomas Feierl
ISAAC
2010
Springer
266views Algorithms» more  ISAAC 2010»
14 years 8 months ago
Structural and Complexity Aspects of Line Systems of Graphs
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
Jozef Jirásek, Pavel Klavík
COCOON
2009
Springer
15 years 4 months ago
Sublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
15 years 3 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu
TIT
1998
90views more  TIT 1998»
14 years 9 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio ...