Sciweavers

766 search results - page 72 / 154
» Online Variance Minimization
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
13 years 2 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
CHI
2003
ACM
16 years 7 days ago
Activity rhythm detection and modeling
We present an algorithm for detecting and modeling rhythmic temporal patterns from the record of an individual's computer activity, or online "presence." The model ...
Rosco Hill, James Begole
CDC
2008
IEEE
106views Control Systems» more  CDC 2008»
15 years 6 months ago
Less conservative robust control of constrained linear systems with bounded disturbances
— This paper develops a novel robust control method for linear systems subject to additive and bounded disturbances. The approach is based on constraint tightening method. The pr...
Reza Ghaemi, Jing Sun, Ilya V. Kolmanovsky
I3E
2003
77views Business» more  I3E 2003»
15 years 1 months ago
Who are the Internet Content Providers?
: The Internet continues its growth as a medium for the sale of goods and services – and yet, although it would seem that digital content was one of the most obvious products for...
Cornelia C. Krueger, Paula M. C. Swatman