Sciweavers

697 search results - page 27 / 140
» Convex Functions on Discrete Sets
Sort
View
ICIP
2003
IEEE
14 years 10 months ago
Algorithms for stochastic approximations of curvature flows
Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame...
Gozde B. Unal, Delphine Nain, G. Ben-Arous, Nahum ...
EOR
2008
159views more  EOR 2008»
13 years 9 months ago
A survey on the continuous nonlinear resource allocation problem
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
Michael Patriksson
TROB
2008
96views more  TROB 2008»
13 years 8 months ago
On Discrete-Time Pursuit-Evasion Games With Sensing Limitations
We address discrete-time pursuit-evasion games in the plane where every player has identical sensing and motion ranges restricted to closed discs of given sensing and stepping rad...
Shaunak Dattaprasad Bopardikar, Francesco Bullo, J...
JMLR
2006
150views more  JMLR 2006»
13 years 8 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian
ICASSP
2011
IEEE
13 years 19 days ago
A-Functions: A generalization of Extended Baum-Welch transformations to convex optimization
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
Dimitri Kanevsky, David Nahamoo, Tara N. Sainath, ...