Sciweavers

1391 search results - page 44 / 279
» Complexity Limitations on Quantum Computation
Sort
View
CHI
2006
ACM
14 years 8 months ago
"Sketching" nurturing creativity: commonalities in art, design, engineering and research
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
Kumiyo Nakakoji, Atau Tanaka, Daniel Fallman
ICCAD
1999
IEEE
68views Hardware» more  ICCAD 1999»
14 years 1 days ago
Throughput optimization of general non-linear computations
This paper addresses an optimal technique for throughput optimization of general non-linear data flow computations using a set of transformations. Throughput is widely recognized ...
Inki Hong, Miodrag Potkonjak, Lisa M. Guerra
IADIS
2004
13 years 9 months ago
Computation and Construction Kits: Toward the Next Generation of Tangible Building Media for Children
Construction kits represent a venerable, creative, and (occasionally) even beautiful genre of educational toys for children. Nonetheless, traditional construction kits have limita...
Michael Eisenberg, Leah Buechley, Nwanua Elumeze
EUROCOLT
1999
Springer
14 years 18 hour ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
CCGRID
2011
IEEE
12 years 11 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan