Sciweavers

309 search results - page 5 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
TON
2008
133views more  TON 2008»
13 years 7 months ago
Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
Cunqing Hua, Tak-Shing Peter Yum
MP
2010
162views more  MP 2010»
13 years 6 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng
CVPR
2000
IEEE
14 years 9 months ago
A Curve Evolution Approach to Smoothing and Segmentation Using the Mumford-Shah Functional
In this work, we approach the classic Mumford-Shah problem from a curve evolution perspective. In particular, we let a given family of curves define the boundaries between regions...
Andy Tsai, Anthony J. Yezzi, Alan S. Willsky
ALIFE
2002
13 years 7 months ago
Ant Colony Optimization and Stochastic Gradient Descent
In this paper, we study the relationship between the two techniques known as ant colony optimization (aco) and stochastic gradient descent. More precisely, we show that some empir...
Nicolas Meuleau, Marco Dorigo

Publication
700views
15 years 4 months ago
Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
David Mumford and Jayant Shah