Sciweavers

218 search results - page 35 / 44
» Constant Rate Approximate Maximum Margin Algorithms
Sort
View
IPPS
2003
IEEE
14 years 27 days ago
Allocating Servers in Infostations for On-Demand Communications
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
ICDE
1999
IEEE
150views Database» more  ICDE 1999»
14 years 9 months ago
Managing Distributed Memory to Meet Multiclass Workload Response Time Goals
In this paper we present an online method for managing a goaloriented buffer partitioning in the distributed memory of a network of workstations. Our algorithm implements a feedba...
Arnd Christian König, Markus Sinnwell
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 2 months ago
Statistical Compressed Sensing of Gaussian Mixture Models
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
Guoshen Yu, Guillermo Sapiro
INFOCOM
2010
IEEE
13 years 6 months ago
Cross-layer Optimization for Wireless Networks with Deterministic Channel Models
Abstract—Existing work on cross-layer optimization for wireless networks adopts simple physical-layer models, i.e., treating interference as noise. In this paper, we adopt a dete...
Ziyu Shao, Minghua Chen, Salman Avestimehr, Shuo-Y...
CORR
2010
Springer
204views Education» more  CORR 2010»
13 years 6 months ago
Predictive State Temporal Difference Learning
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
Byron Boots, Geoffrey J. Gordon