Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICASSP
2011
IEEE
10 years 5 months ago
Ordering for energy efficient estimation and optimization in sensor networks
A discretized version of a continuous optimization problem is considered for the case where data is obtained from a set of dispersed sensor nodes and the overall metric is a sum o...
Rick S. Blum
FSTTCS
2010
Springer
10 years 11 months ago
Average Analysis of Glushkov Automata under a BST-Like Model
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Cyril Nicaud, Carine Pivoteau, Benoît Razet
MST
2002
152views more  MST 2002»
11 years 27 days ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
CORR
2007
Springer
72views Education» more  CORR 2007»
11 years 1 months ago
How much feedback is required in MIMO Broadcast Channels?
— In this paper, a downlink communication system, in which a Base Station (BS) equipped with M antennas communicates with N users each equipped with K receive antennas is conside...
Alireza Bayesteh, Amir K. Khandani
MCU
2004
59views Hardware» more  MCU 2004»
11 years 2 months ago
On the Complexity of Universal Programs
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...
Alain Colmerauer
PODC
2003
ACM
11 years 6 months ago
Adapting to a reliable network path
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
Baruch Awerbuch, Yishay Mansour
ISCC
2005
IEEE
11 years 6 months ago
Degree-Optimal Deterministic Routing for P2P Systems
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...
books