Sciweavers

309 search results - page 28 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
95
Voted
CSDA
2010
132views more  CSDA 2010»
15 years 16 days ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
123
Voted
STACS
2005
Springer
15 years 6 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
77
Voted
IJCAI
2007
15 years 1 months ago
Automatic Gait Optimization with Gaussian Process Regression
Gait optimization is a basic yet challenging problem for both quadrupedal and bipedal robots. Although techniques for automating the process exist, most involve local function opt...
Daniel J. Lizotte, Tao Wang, Michael H. Bowling, D...
SIAMSC
2008
237views more  SIAMSC 2008»
15 years 11 days ago
A Variational Shape Optimization Approach for Image Segmentation with a Mumford--Shah Functional
We introduce a novel computational method for a Mumford-Shah functional, which decomposes a given image into smooth regions separated by closed curves. Casting this as a shape opti...
Günay Dogan, Pedro Morin, Ricardo H. Nochetto
CVPR
1998
IEEE
16 years 2 months ago
Segmentation by Grouping Junctions
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...
Hiroshi Ishikawa 0002, Davi Geiger