1604 search results - page 94 / 321 » Regularization on Discrete Spaces |
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
SIBGRAPI
2008
IEEE
14 years 4 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
Abstract We introduce a parameterized notion of feature size that interpolates between the minimum of the local feature size and the recently introduced weak feature size. Based on...
SCALESPACE
2009
Springer
14 years 4 months ago
2009
Springer
Adding external knowledge improves the results for ill-posed problems. In this paper we present a new multi-level optimization framework for image registration when adding landmark...