2252 search results - page 352 / 451 » Improving Random Forests |
159
click to vote
STOC
1998
ACM
15 years 5 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
99
Voted
CP
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search procedures. Our study reveals some intrig...
94
Voted
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Automatic face sketch synthesis has important applications in law enforcement and digital entertainment. Although great progress has been made in recent years, previous methods onl...
98
Voted
ISSTA
1993
ACM
15 years 4 months ago
1993
ACM
Most of the effort that goes into improving the quality of software paradoxically does not lead to quantitative, measurable quality. Software developers and quality-assurance orga...
79
Voted
STOC
1993
ACM
15 years 4 months ago
1993
ACM
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...