Sciweavers

358 search results - page 69 / 72
» Sparse squares of polynomials
Sort
View
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
14 years 8 months ago
List decoding tensor products and interleaved codes
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...
ICCD
2001
IEEE
121views Hardware» more  ICCD 2001»
14 years 4 months ago
Determining Schedules for Reducing Power Consumption Using Multiple Supply Voltages
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...
Noureddine Chabini, El Mostapha Aboulhamid, Yvon S...
IROS
2009
IEEE
185views Robotics» more  IROS 2009»
14 years 2 months ago
Scalable and convergent multi-robot passive and active sensing
— A major barrier preventing the wide employment of mobile networks of robots in tasks such as exploration, mapping, surveillance, and environmental monitoring is the lack of ef...
Elias B. Kosmatopoulos, Lefteris Doitsidis, Konsta...
WADS
2001
Springer
63views Algorithms» more  WADS 2001»
14 years 2 days ago
When Can You Fold a Map?
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequenc...
Esther M. Arkin, Michael A. Bender, Erik D. Demain...
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
13 years 11 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani