64 search results - page 7 / 13 » Locally Competitive Algorithms for Sparse Approximation |
AROBOTS
2006
13 years 7 months ago
2006
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...
EMO
2003
Springer
14 years 17 days ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
TOG
2010
13 years 2 months ago
2010
Accurately rendering glossy materials in design applications, where previewing and interactivity are important, remains a major challenge. While many fast global illumination solu...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...