Sciweavers

768 search results - page 121 / 154
» Asymptotic Cellular Complexity
Sort
View
TSP
2008
115views more  TSP 2008»
13 years 7 months ago
Sinusoidal Modeling and Adaptive Channel Prediction in Mobile OFDM Systems
We propose a wireless fading channel prediction algorithm for a pilot-symbol aided Orthogonal Frequency Division Multiplexing (OFDM) system. Assuming a doubly selective (time and ...
Ian C. Wong, Brian L. Evans
COCOA
2010
Springer
13 years 5 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 2 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
MICROMACHINES
2011
13 years 2 months ago
Modeling Self-Assembly Across Scales: The Unifying Perspective of Smart Minimal Particles
: A wealth of current research in microengineering aims at fabricating devices of increasing complexity, notably by (self-)assembling elementary components into heterogeneous funct...
Massimo Mastrangeli, Grégory Mermoud, Alche...
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 7 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin