Sciweavers

8025 search results - page 30 / 1605
» Combinators Introduction: An Algorithm
Sort
View
ECCV
2006
Springer
15 years 11 months ago
Learning to Combine Bottom-Up and Top-Down Segmentation
Bottom-up segmentation based only on low-level cues is a notoriously difficult problem. This difficulty has lead to recent top-down segmentation algorithms that are based on class-...
Anat Levin, Yair Weiss
VMCAI
2007
Springer
15 years 3 months ago
Invariant Synthesis for Combined Theories
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, A...
IDA
2007
Springer
15 years 3 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
NAACL
2003
14 years 11 months ago
Unsupervised methods for developing taxonomies by combining syntactic and statistical information
This paper describes an unsupervised algorithm for placing unknown words into a taxonomy and evaluates its accuracy on a large and varied sample of words. The algorithm works by ï...
Dominic Widdows
CIKM
2010
Springer
14 years 8 months ago
Evaluating, combining and generalizing recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...