Sciweavers

8025 search results - page 9 / 1605
» Combinators Introduction: An Algorithm
Sort
View
CVPR
2004
IEEE
15 years 11 months ago
A Probabilistic Framework for Combining Tracking Algorithms
For the past few years researches have been investigating enhancing tracking performance by combining several different tracking algorithms. We propose an analytically justified, ...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin
ESOP
2008
Springer
14 years 11 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
ICML
1998
IEEE
15 years 10 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
ICPP
2003
IEEE
15 years 2 months ago
A Parallel Algorithm for Enumerating Combinations
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
Martha Torres, Alfredo Goldman, Junior Barrera
ICML
2003
IEEE
15 years 10 months ago
Using Linear-threshold Algorithms to Combine Multi-class Sub-experts
We present a new type of multi-class learning algorithm called a linear-max algorithm. Linearmax algorithms learn with a special type of attribute called a sub-expert. A sub-exper...
Chris Mesterharm