Sciweavers

780 search results - page 13 / 156
» Robustness and Randomness
Sort
View
MSWIM
2006
ACM
14 years 2 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
IJAR
2010
189views more  IJAR 2010»
13 years 7 months ago
A fuzzy random forest
Following Breiman’s methodology, we propose a multi-classifier based on a “forest” of randomly generated fuzzy decision trees, i.e., a Fuzzy Random Forest. This approach co...
Piero P. Bonissone, José Manuel Cadenas, M....
IPTPS
2003
Springer
14 years 2 months ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder
VMV
2001
303views Visualization» more  VMV 2001»
13 years 10 months ago
Extracting Cylinders in Full 3D Data Using a Random Sampling Method and the Gaussian Image
This paper presents a new method for extracting cylinders from an unorganized set of 3D points. The originality of this approach is to separate the extraction problem into two dis...
Thomas Chaperon, François Goulette
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...