Sciweavers

478 search results - page 54 / 96
» Approximation algorithms for general packing problems and th...
Sort
View
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 9 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
JMLR
2006
125views more  JMLR 2006»
13 years 8 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
13 years 3 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner
INFOCOM
2006
IEEE
14 years 2 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
ECCV
2008
Springer
14 years 10 months ago
Online Sparse Matrix Gaussian Process Regression and Vision Applications
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
Ananth Ranganathan, Ming-Hsuan Yang