Sciweavers

1017 search results - page 61 / 204
» On the Power of k -Consistency
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 4 months ago
High-Throughput Random Access via Codes on Graphs
—Recently, contention resolution diversity slotted ALOHA (CRDSA) has been introduced as a simple but effective improvement to slotted ALOHA. It relies on MAC burst repetitions an...
Gianluigi Liva, Enrico Paolini, Marco Chiani
IEEEPACT
2007
IEEE
16 years 14 days ago
L1 Cache Filtering Through Random Selection of Memory References
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
Yoav Etsion, Dror G. Feitelson
WG
2004
Springer
15 years 11 months ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji
GLOBECOM
2006
IEEE
16 years 6 days ago
Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks
— In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that t...
Guofeng Deng, Sandeep K. S. Gupta
ICASSP
2010
IEEE
15 years 6 months ago
On the outage and diversity-multiplexing tradeoff of broadcast channels with 1-bit feedback
In this paper, a single antenna downlink channel with K users is analyzed in the presence of Rayleigh flat fading. A limited channel state information (CSI) feedback scheme is co...
Bo Niu, Alexander M. Haimovich