Sciweavers

356 search results - page 33 / 72
» Parallelizing time with polynomial circuits
Sort
View
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Upper Bounds on the Computational Power of an Optical Model of Computation
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
Damien Woods
UC
2005
Springer
14 years 2 months ago
Lower Bounds on the Computational Power of an Optical Model of Computation
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
Damien Woods, J. Paul Gibson
ICCAD
2010
IEEE
125views Hardware» more  ICCAD 2010»
13 years 7 months ago
Peak current reduction by simultaneous state replication and re-encoding
Reducing circuit's peak current plays an important role in circuit reliability in deep sub-micron era. For sequential circuits, it is observed that the peak current has a str...
Junjun Gu, Gang Qu, Lin Yuan, Qiang Zhou
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 3 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
HPCC
2007
Springer
14 years 3 months ago
Optimizing Performance of Automatic Training Phase for Application Performance Prediction in the Grid
Abstract. Automatic execution time prediction of the Grid applications plays a critical role in making the pervasive Grid more reliable and predictable. However, automatic executio...
Farrukh Nadeem, Radu Prodan, Thomas Fahringer