Sciweavers

1060 search results - page 107 / 212
» On the Discovery of Random Trees
Sort
View
ECML
2007
Springer
15 years 10 months ago
Ensembles of Multi-Objective Decision Trees
Abstract. Ensemble methods are able to improve the predictive performance of many base classifiers. Up till now, they have been applied to classifiers that predict a single target ...
Dragi Kocev, Celine Vens, Jan Struyf, Saso Dzerosk...
CN
2007
154views more  CN 2007»
15 years 6 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
ICIP
2001
IEEE
16 years 8 months ago
Feature coincidence trees for registration of ultrasound breast images
Registration of an image, the query or reference, to a database of rotated and translated exemplars constitutes an important image retrieval and indexing application which arises i...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson
ICIP
1995
IEEE
16 years 7 months ago
Multiresolution model development for overlapping trees via canonical correlation analysis
Recently a class of multiscale stochastic models has been introducedin which Gaussian random processes are described by scale-recursive dynamics that are indexed by the nodes of a...
Paul W. Fieguth, William W. Irving, Alan S. Willsk...
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 6 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler