Sciweavers

1362 search results - page 235 / 273
» Means, Correlations and Bounds
Sort
View
TCS
2008
14 years 11 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
INFORMATICALT
2010
119views more  INFORMATICALT 2010»
14 years 10 months ago
Tight Arrival Curve at the Output of a Work-Conserving Blind Multiplexing Server
Abstract. As a means of supporting quality of service guarantees, aggregate multiplexing has attracted a lot of attention in the networking community, since it requires less comple...
Juan Echagüe, Vicent Cholvi
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 3 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
INFOCOM
2011
IEEE
14 years 3 months ago
General capacity scaling of wireless networks
—We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions ...
Cheng Wang, Changjun Jiang, Xiang-Yang Li, ShaoJie...
ASPLOS
2012
ACM
13 years 7 months ago
DreamWeaver: architectural support for deep sleep
Numerous data center services exhibit low average utilization leading to poor energy efficiency. Although CPU voltage and frequency scaling historically has been an effective mea...
David Meisner, Thomas F. Wenisch