Sciweavers

1552 search results - page 179 / 311
» On the Complexity of Constant Propagation
Sort
View
IJFCS
2010
92views more  IJFCS 2010»
15 years 3 months ago
Collapsing the Hierarchy of Parallel Computational Models
We investigate the computational power of parallel models with directed reconfigurable buses and with shared memory. Based on feasibility considerations present in the literature,...
Stefan D. Bruda, Yuanqiao Zhang
IJISEC
2010
114views more  IJISEC 2010»
15 years 3 months ago
A new hardware-assisted PIR with O(n) shuffle cost
Abstract Since the concept of private information retrieval (PIR) was first formalized by Chor et. al, various constructions have been proposed with a common goal of reducing commu...
Xuhua Ding, Yanjiang Yang, Robert H. Deng, Shuhong...
CDC
2010
IEEE
164views Control Systems» more  CDC 2010»
15 years 1 months ago
A recursive system identification method based on binary measurements
Abstract-- An online approach to parameter estimation problems based on binary observations is presented in this paper. This recursive identification method relies on a least-mean ...
Kian Jafari, Jérôme Juillard, É...
CORR
2011
Springer
147views Education» more  CORR 2011»
15 years 1 months ago
Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
Marius Zimand
ECCC
2010
147views more  ECCC 2010»
15 years 1 months ago
A Note on Amplifying the Error-Tolerance of Locally Decodable Codes
Trevisan [Tre03] suggested a transformation that allows amplifying the error rate a code can handle. We observe that this transformation, that was suggested in the non-local setti...
Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma