Sciweavers

674 search results - page 1 / 135
» Lower Bounds on the Computational Power of an Optical Model ...
Sort
View
UC
2005
Springer
13 years 10 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
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
13 years 10 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
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 4 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
SPDP
1990
IEEE
13 years 8 months ago
Energy complexity of optical computations
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
Akhilesh Tyagi, John H. Reif
IWANN
1997
Springer
13 years 8 months ago
Lower Bounds of Computational Power of a Synaptic Calculus
João Pedro Guerreiro Neto, José F&ea...