3533 search results - page 50 / 707 » Locally Optimized RANSAC |
155
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
134
click to vote
ICS
2005
Tsinghua U.
15 years 11 months ago
2005
Tsinghua U.
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
177
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Improving coding and spatial pooling for bag-of-words based feature design have gained a lot of attention in recent works addressing object recognition and scene classification. ...
142
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
208
click to vote
JMLR
2012
13 years 8 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...