Sciweavers

2621 search results - page 33 / 525
» Near orders and codes
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
Maximizing the lifetime of clusters with Slepian-Wolf coding
In this paper, we propose an iteration-free algorithm to find the optimal configuration, including transmit power and source coding rates, to maximize the lifetime of a cluster ...
Tianqi Wang, Wendi Rabiner Heinzelman, Alireza Sey...
TCOM
2008
106views more  TCOM 2008»
13 years 8 months ago
Walsh coded training signal aided time domain channel estimation for MIMO-OFDM systems
This letter proposes a novel Walsh coded training signal design and decoding method to estimate the channel response in MIMO-OFDM systems. The Walsh coded training signals, designe...
Hyoung-Goo Jeon, Hyoung-Kyu Song, Erchin Serpedin
PODC
2005
ACM
14 years 2 months ago
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
We propose a scheme for building peer-to-peer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, c...
Kamal Jain, László Lovász, Ph...
CGO
2007
IEEE
14 years 2 months ago
Persistent Code Caching: Exploiting Code Reuse Across Executions and Applications
Run-time compilation systems are challenged with the task of translating a program’s instruction stream while maintaining low overhead. While software managed code caches are ut...
Vijay Janapa Reddi, Dan Connors, Robert Cohn, Mich...
ESA
2008
Springer
92views Algorithms» more  ESA 2008»
13 years 10 months ago
How Reliable Are Practical Point-in-Polygon Strategies?
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
Stefan Schirra