3135 search results - page 129 / 627 » Localization Algorithms: Performance Evaluation and Reliabil... |
124
Voted
SMC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— Some of the established approaches to evaluating text clustering algorithms for information retrieval show theoretical flaws. In this paper, we analyze these flaws an...
121
Voted
EVOW
2007
Springer
15 years 9 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
120
Voted
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
Machine learning often relies on costly labeled data, and this impedes its application to new classification and information extraction problems. This has motivated the developme...
130
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
In the last decades several cost aggregation methods aimed at improving the robustness of stereo correspondence within local and global algorithms have been proposed. Given the re...
138
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...