407 search results - page 43 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
STACS
2004
Springer
15 years 5 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
NIPS
2007
15 years 1 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
115
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
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 ≥...
114
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
We present a novel algorithm for automatically applying constrainable, L1-optimal camera paths to generate stabilized videos by removing undesired motions. Our goal is to compute ...
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper discusses several distributed poweraware routing protocols in wireless ad-hoc networks (especially sensor networks). We seek to optimize the lifetime of the network. We...