Sciweavers

545 search results - page 46 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
ATAL
2008
Springer
15 years 6 months ago
Dynamics based control with PSRs
We present an extension of the Dynamics Based Control (DBC) paradigm to environment models based on Predictive State Representations (PSRs). We show an approximate greedy version ...
Ariel Adam, Zinovi Rabinovich, Jeffrey S. Rosensch...
LCN
2005
IEEE
15 years 9 months ago
Approximate Coverage in Wireless Sensor Networks
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
Yuzhen Liu, Weifa Liang
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
16 years 1 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
STOC
2006
ACM
180views Algorithms» more  STOC 2006»
16 years 4 months ago
Pricing for fairness: distributed resource allocation for multiple objectives
In this paper, we present a simple distributed algorithm for resource allocation which simultaneously approximates the optimum value for a large class of objective functions. In p...
Sung-woo Cho, Ashish Goel
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
15 years 10 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic