1261 search results - page 182 / 253 » Approximation algorithms for aligning points |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
129
click to vote
TKDE
2012
13 years 5 days ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
107
click to vote
NIPS
2001
14 years 11 months ago
2001
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
101
click to vote
BC
2005
14 years 9 months ago
2005
Abstract Weproposeacomputationalmodelofcontourintegration for visual saliency. The model uses biologically plausible devices to simulate how the representations of elements aligned...
102
click to vote
IVC
2008
14 years 9 months ago
2008
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...