1387 search results - page 100 / 278 » Convexity in Discrete Space |
207
click to vote
SODA
2010
ACM
16 years 3 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...
192
click to vote
SIBGRAPI
2008
IEEE
16 years 20 days 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...
150
click to vote
COMPGEOM
2006
ACM
16 years 8 days 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...
174
click to vote
SCALESPACE
2009
Springer
16 years 25 days 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...
154
click to vote
CAAN
2004
Springer
15 years 11 months ago
2004
Springer
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...