Sciweavers

2938 search results - page 206 / 588
» On obfuscating point functions
Sort
View
INFORMS
1998
100views more  INFORMS 1998»
15 years 6 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
MOR
2010
120views more  MOR 2010»
15 years 5 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...
CVPR
2005
IEEE
16 years 8 months ago
Shape Matching and Object Recognition Using Low Distortion Correspondences
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
Alexander C. Berg, Tamara L. Berg, Jitendra Malik
ECCV
2008
Springer
16 years 8 months ago
Multi-stage Contour Based Detection of Deformable Objects
We present an efficient multi stage approach to detection of deformable objects in real, cluttered images given a single or few hand drawn examples as models. The method handles de...
Saiprasad Ravishankar, Arpit Jain, Anurag Mittal
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 11 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom