51 search results - page 8 / 11 » Phase Transitions for Greedy Sparse Approximation Algorithms |
91
Voted
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...
CP
2005
Springer
15 years 5 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
Publication
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
110
click to vote
PPSN
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...