4229 search results - page 431 / 846 » On the Optimality of Spiral Search |
183
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shar...
180
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
204
click to vote
VIS
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
165
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
WebPMI is a popular web-based association measure to evaluate the semantic similarity between two queries (i.e. words or entities) by leveraging search results returned by search ...
229
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...