Sciweavers

1060 search results - page 1 / 212
» On the Discovery of Random Trees
Sort
View
CORR
2007
Springer
86views Education» more  CORR 2007»
13 years 4 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
13 years 9 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
14 years 5 months ago
Using randomized response techniques for privacy-preserving data mining
Privacy is an important issue in data mining and knowledge discovery. In this paper, we propose to use the randomized response techniques to conduct the data mining computation. S...
Wenliang Du, Zhijun Zhan
AINA
2008
IEEE
13 years 11 months ago
Optimal Resource Discovery Paths of Gnutella2
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
13 years 4 months ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger