Sciweavers

3875 search results - page 251 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
INFOCOM
1998
IEEE
15 years 11 months ago
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
Santosh Paul Abraham, Anurag Kumar
ICML
2010
IEEE
15 years 7 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
JAIR
2006
160views more  JAIR 2006»
15 years 6 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
DAGSTUHL
2007
15 years 8 months ago
Nonlinear Approximation and Image Representation using Wavelets
We address the problem of finding sparse wavelet representations of high-dimensional vectors. We present a lower-bounding technique and use it to develop an algorithm for computi...
Sudipto Guha, Boulos Harb
MP
2006
119views more  MP 2006»
15 years 6 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey