Sciweavers

218 search results - page 30 / 44
» Constant Rate Approximate Maximum Margin Algorithms
Sort
View
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
13 years 6 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt
ADHOCNETS
2009
Springer
14 years 2 months ago
Improved Topology Control Algorithms for Simple Mobile Networks
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
Fei Che, Errol L. Lloyd, Liang Zhao
MAM
2006
95views more  MAM 2006»
13 years 7 months ago
A selective DVS technique based on battery residual
Conventional research on DVS assumes that the battery, which is the power source of most mobile devices, provides constant power; the battery, however, has unique discharge charac...
Sukwon Choi, Hojung Cha, Rhan Ha
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 1 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
FOCS
2007
IEEE
14 years 2 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák