5592 search results - page 157 / 1119 » On Random Betweenness Constraints |
141
Voted
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a rando...
131
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
137
click to vote
ALENEX
2007
15 years 6 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
143
Voted
IJON
2007
15 years 4 months ago
2007
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
131
click to vote
ICIC
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...