8025 search results - page 30 / 1605 » Combinators Introduction: An Algorithm |
107
click to vote
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
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-...
119
click to vote
VMCAI
2007
Springer
15 years 7 months ago
2007
Springer
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...
IDA
2007
Springer
15 years 7 months ago
2007
Springer
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...
117
click to vote
NAACL
2003
15 years 2 months ago
2003
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 ï...
88
Voted
CIKM
2010
Springer
15 years 3 days ago
2010
Springer
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...