2542 search results - page 91 / 509 » Computing Cartograms with Optimal Complexity |
133
Voted
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
110
click to vote
APPML
2007
15 years 3 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
130
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
139
click to vote
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
138
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...