Sciweavers

2912 search results - page 181 / 583
» Logistic Model Trees
Sort
View
SIGGRAPH
1995
ACM
15 years 7 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 5 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 3 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
139
Voted
ICIP
2004
IEEE
16 years 5 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...
TAMC
2007
Springer
15 years 10 months ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...