Sciweavers

680 search results - page 54 / 136
» A randomized embedding algorithm for trees
Sort
View
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
14 years 1 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 3 months ago
Physical expander in Virtual Tree Overlay
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valer...
CVPR
2005
IEEE
14 years 11 months ago
Random Subwindows for Robust Image Classification
We present a novel, generic image classification method based on a recent machine learning algorithm (ensembles of extremely randomized decision trees). Images are classified usin...
Justus H. Piater, Louis Wehenkel, Pierre Geurts, R...
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
14 years 1 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...
ICCV
2005
IEEE
14 years 10 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu