309 search results - page 18 / 62 » Smooth Optimization with Approximate Gradient |
106
click to vote
MOC
2010
14 years 4 months ago
2010
Numerical schemes to compute approximate solutions of the evolutionary Stokes and Navier-Stokes equations are studied. The schemes are discontinuous in time and conforming in space...
74
Voted
NIPS
2003
14 years 11 months ago
2003
We develop a protocol for optimizing dynamic behavior of a network of simple electronic components, such as a sensor network, an ad hoc network of mobile devices, or a network of ...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
105
Voted
KDD
2012
ACM
13 years 2 days ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
74
Voted
TWC
2010
14 years 4 months ago
2010
We introduce a new sequential importance sampling (SIS) algorithm which propagates in time a Monte Carlo approximation of the posterior fixed-lag smoothing distribution of the symb...