Sciweavers

2370 search results - page 49 / 474
» A Structured Set of Higher-Order Problems
Sort
View
ICCV
1998
IEEE
14 years 1 months ago
Integrated Surface, Curve and Junction Inference from Sparse 3-D Data Sets
We areinterestedin descriptionsof 3-D data sets,as obtained from stereoor a 3-D digitizer. We thereforeconsideras inputa sparsesetof points, possibly associated with certain orien...
Chi-Keung Tang, Gérard G. Medioni
MOR
2010
120views more  MOR 2010»
13 years 7 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
14 years 3 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
ICRA
2005
IEEE
103views Robotics» more  ICRA 2005»
14 years 2 months ago
Dimensioning a Constrained Parallel Robot to Reach a Set of Task Positions
— The paper considers the problem of setting the dimensions of a system of constrained parallel robots to ensure that together they can position an end-effector in a specified s...
Hai-Jun Su, J. Michael McCarthy
SPAA
2010
ACM
14 years 1 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela