Sciweavers

1261 search results - page 141 / 253
» Approximation algorithms for aligning points
Sort
View
TIT
2002
75views more  TIT 2002»
14 years 9 months ago
Iterative multiuser joint decoding: Unified framework and asymptotic analysis
We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algor...
Joseph Boutros, Giuseppe Caire
PAMI
2012
13 years 13 days ago
Image Signature: Highlighting Sparse Salient Regions
—We introduce a simple image descriptor referred to as the image signature. We show, within the theoretical framework of sparse signal mixing, that this quantity spatially approx...
Xiaodi Hou, Jonathan Harel, Christof Koch
VMV
2007
155views Visualization» more  VMV 2007»
14 years 11 months ago
Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky e...
David Bommes, Leif Kobbelt
AAIM
2008
Springer
90views Algorithms» more  AAIM 2008»
15 years 4 months ago
Facility Location Problems: A Parameterized View
Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, ...
Michael R. Fellows, Henning Fernau
CCCG
2006
14 years 11 months ago
Shortest Descending Paths through Given Faces
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Anna Lubiw