1469 search results - page 143 / 294 » Approximate polynomial decomposition |
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
107
click to vote
RTAS
2006
IEEE
15 years 4 months ago
2006
IEEE
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
DAM
2008
14 years 10 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
204
click to vote
INFOCOM
2012
IEEE
13 years 14 days ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
ICCV
2007
IEEE
15 years 12 months ago
2007
IEEE
We employ 3D arrangements of curves to represent and analyze biological shapes, in particular, the anatomy of the human brain. The arrangements of curves may vary from fairly spar...