Sciweavers

989 search results - page 132 / 198
» Classification and regression trees
Sort
View
ECCV
2010
Springer
15 years 2 days ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
JAL
2002
113views more  JAL 2002»
14 years 11 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
CPC
1999
105views more  CPC 1999»
14 years 11 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill
ECCB
2008
IEEE
15 years 6 months ago
Connect the dots: exposing hidden protein family connections from the entire sequence tree
Motivation: Mapping of remote evolutionary links is a classic computational problem of much interest. Relating protein families allows for functional and structural inference on u...
Yaniv Loewenstein, Michal Linial
ICFP
2010
ACM
15 years 29 days ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...