Sciweavers

5699 search results - page 195 / 1140
» Alternating model trees
Sort
View
ECSQARU
2009
Springer
16 years 18 days ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
SIGGRAPH
1995
ACM
15 years 9 months ago
Creation and rendering of realistic trees
Recent advances in computer graphics have produced images approaching the elusive goal of photorealism. Since many natural objects are so complex and detailed, they are often not ...
Jason Weber, Joseph Penn
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 7 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
ML
2006
ACM
163views Machine Learning» more  ML 2006»
15 years 6 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
ICIP
2004
IEEE
16 years 7 months ago
Object recognition based on binary partition trees
This paper presents an object recognition method that exploits the representation of the images obtained by means of a Binary Partition Tree (BPT). The shape matching technique in...
Oreste Salerno, Montse Pardàs, Verón...