Sciweavers

3250 search results - page 18 / 650
» Parameterized Learning Complexity
Sort
View
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
13 years 11 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
CAD
2004
Springer
13 years 9 months ago
3D surface filtering using spherical harmonics
This paper presents a novel approach for 3D surface filtering over two-manifold meshes. A robust spherical parameterization algorithm is proposed to transform the input surface in...
Kun Zhou, Hujun Bao, Jiaoying Shi
PAMI
2010
205views more  PAMI 2010»
13 years 8 months ago
Learning a Hierarchical Deformable Template for Rapid Deformable Object Parsing
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
Long Zhu, Yuanhao Chen, Alan L. Yuille
CJ
2008
69views more  CJ 2008»
13 years 10 months ago
Some Parameterized Problems On Digraphs
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
Gregory Gutin, Anders Yeo
ECCC
2007
86views more  ECCC 2007»
13 years 9 months ago
On Parameterized Approximability
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
Yijia Chen, Martin Grohe, Magdalena Grüber