Sciweavers

369 search results - page 61 / 74
» Approximation Algorithms for the Bi-criteria Weighted max-cu...
Sort
View
NIPS
1998
15 years 1 months ago
Gradient Descent for General Reinforcement Learning
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
Leemon C. Baird III, Andrew W. Moore
ICIP
2010
IEEE
14 years 9 months ago
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...
Yingsong Zhang, Nick G. Kingsbury
EVOW
2010
Springer
14 years 10 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
CDC
2010
IEEE
117views Control Systems» more  CDC 2010»
14 years 6 months ago
Distributed iterative regularization algorithms for monotone Nash games
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
Aswin Kannan, Uday V. Shanbhag
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 9 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau