Sciweavers

437 search results - page 62 / 88
» Randomized Lattice Decoding
Sort
View
99
Voted
PDCAT
2005
Springer
15 years 5 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
INFOCOM
1989
IEEE
15 years 3 months ago
An Efficient Multiple-Access Method for the Binary Adder Channel
Consider M - HChoose P - T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method f...
Israel Bar-David, Eli Plotnik, Raphael Rom
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
14 years 11 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
TIT
2002
63views more  TIT 2002»
14 years 11 months ago
Structured unitary space-time autocoding constellations
We recently showed that arbitrarily reliable communication is possible within a single coherence interval in Rayleigh flat fading as the symbol-duration of the coherence interval ...
Thomas L. Marzetta, Babak Hassibi, Bertrand M. Hoc...
ICIP
2007
IEEE
16 years 1 months ago
Encoding Parameter Estimation for RDTC Optimized Compression and Streaming of Image-Based Scene Representations
Remote navigation in image-based scene representations requires random access to parts of the compressed reference image data to compose virtual views. The degree of dependencies ...
Ingo Bauermann, Eckehard G. Steinbach