Sciweavers

15033 search results - page 293 / 3007
» Complexity Theory and Algorithms
Sort
View
PAMI
2006
230views more  PAMI 2006»
15 years 5 months ago
Shape Registration in Implicit Spaces Using Information Theory and Free Form Deformations
We present a novel variational and statistical approach for shape registration. Shapes of interest are implicitly embedded in a higher dimensional space of distance transforms. In...
Xiaolei Huang, Nikos Paragios, Dimitris N. Metaxas
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 5 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier
112
Voted
JCP
2007
94views more  JCP 2007»
15 years 4 months ago
Low-Complexity Analysis of Repetitive Regularities for Biometric Applications
— Presented in this paper is a joint algorithm optimization and architecture design framework for analysis of repetitive regularities. Two closely coupled algorithm optimization ...
Lei Wang, Niral Patel
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 10 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
15 years 11 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità