Sciweavers

118 search results - page 23 / 24
» soda 2008
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
ICASSP
2008
IEEE
13 years 11 months ago
Analyzing the scalability of SIMD for the next generation software defined radio
Previous studies have shown that wireless DSP algorithms exhibit high levels of data level parallelism (DLP). Commercial and research work in the field of software defined radio...
Mark Woh, Yuan Lin, Sangwon Seo, Trevor N. Mudge, ...
IROS
2008
IEEE
131views Robotics» more  IROS 2008»
13 years 11 months ago
Deformations of general parametric shells: Computation and robot experiment
— A shell is a body enclosed between two closely spaced and curved surfaces. Classical theory of shells [38], [33], [16] assumes a parametrization along the lines of principal cu...
Yan-Bin Jia, Jiang Tian
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
13 years 7 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
SMA
2008
ACM
149views Solid Modeling» more  SMA 2008»
13 years 4 months ago
Exact arrangements on tori and Dupin cyclides
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
Eric Berberich, Michael Kerber