Sciweavers

895 search results - page 28 / 179
» Approximate convex decomposition
Sort
View
85
Voted
ICASSP
2010
IEEE
14 years 7 months ago
A transient analysis for the convex combination of two adaptive filters with transfer of coefficients
This paper proposes an improved model for the transient of convex combinations of adaptive filters. A previous model, based on a firstorder Taylor series approximation of the nonl...
Magno T. M. Silva, Vitor H. Nascimento, Jeró...
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
14 years 9 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 1 months ago
Large-Scale Convex Minimization with a Low-Rank Constraint
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
Shai Shalev-Shwartz, Alon Gonen, Ohad Shamir
SIAMJO
2002
73views more  SIAMJO 2002»
14 years 9 months ago
Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
We study best approximation problems with nonlinear constraints in Hilbert spaces. The strong "conical hull intersection property" (CHIP) and the "basic constraint q...
Chong Li, Xiao-Qing Jin
DGCI
2009
Springer
15 years 28 days ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
Xavier Provençal, Jacques-Olivier Lachaud