Sciweavers

508 search results - page 81 / 102
» Poly-locality in quantum computing
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf
IPPS
2005
IEEE
15 years 3 months ago
Desynchronized Pfair Scheduling on Multiprocessors
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...
UmaMaheswari C. Devi, James H. Anderson
ICANN
2009
Springer
15 years 2 months ago
Bayesian Estimation of Kernel Bandwidth for Nonparametric Modelling
Kernel density estimation (KDE) has been used in many computational intelligence and computer vision applications. In this paper we propose a Bayesian estimation method for findin...
Adrian G. Bors, Nikolaos Nasios
ATS
2005
IEEE
164views Hardware» more  ATS 2005»
14 years 11 months ago
A Family of Logical Fault Models for Reversible Circuits
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent design requirement of quantum computation. Logical fault models for conventional ...
Ilia Polian, Thomas Fiehn, Bernd Becker, John P. H...
DAC
2008
ACM
14 years 11 months ago
Technology exploration for graphene nanoribbon FETs
Graphene nanoribbon FETs (GNRFETs) are promising devices for beyond-CMOS nanoelectronics because of their excellent carrier transport properties and potential for large scale proc...
Mihir R. Choudhury, Youngki Yoon, Jing Guo, Kartik...