Sciweavers

17 search results - page 3 / 4
» List Decodability at Small Radii
Sort
View
ICRA
2002
IEEE
97views Robotics» more  ICRA 2002»
15 years 3 months ago
Gripping Parts at Concave Vertices
ct A simple gripper with two vertical cylindrical jaws can make contact with external or internal concavities in polygonal and polyhedral parts to align and grip parts in form clos...
K. Gopalakrishnan 0002, Kenneth Y. Goldberg
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
15 years 7 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
ICC
2007
IEEE
15 years 4 months ago
Turbo Multiuser Detection Based on Local Search Algorithms
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
Zhiliang Qin, Kui Cai, Xiaoxin Zou
TIT
2010
136views Education» more  TIT 2010»
14 years 4 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
14 years 8 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...