Sciweavers

58 search results - page 10 / 12
» Optimal space lower bounds for all frequency moments
Sort
View
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
13 years 20 days ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
76
Voted
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
15 years 4 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
93
Voted
EMSOFT
2010
Springer
14 years 8 months ago
Power-aware temporal isolation with variable-bandwidth servers
Variable-bandwidth servers (VBS) control process execution speed by allocating variable CPU bandwidth to processes. VBS enables temporal isolation of EDF-scheduled processes in th...
Silviu S. Craciunas, Christoph M. Kirsch, Ana Soko...
CORR
2010
Springer
140views Education» more  CORR 2010»
14 years 10 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
CORR
2007
Springer
47views Education» more  CORR 2007»
14 years 10 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...