Sciweavers

2577 search results - page 410 / 516
» Multimedia Question Answering
Sort
View
CORR
2004
Springer
90views Education» more  CORR 2004»
15 years 4 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
CPHYSICS
2004
85views more  CPHYSICS 2004»
15 years 4 months ago
Beyond benchmarking - how experiments and simulations can work together in plasma physics
There has been dramatic progress in the scope and power of plasma simulations in recent years; and because codes are generally cheaper to write, to run and to diagnose than experi...
Martin Greenwald
COMPUTER
2000
128views more  COMPUTER 2000»
15 years 4 months ago
What's Ahead for Embedded Software?
hysical world. How do you adapt software abstractions designed merely to transform data to meet requirements like real-time constraints, concurrency, and stringent safety considera...
Edward A. Lee
ECCC
2000
158views more  ECCC 2000»
15 years 4 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
CORR
2002
Springer
110views Education» more  CORR 2002»
15 years 4 months ago
Long Proteins with Unique Optimal Foldings in the H-P Model
It is widely accepted that (1) the natural or folded state of proteins is a global energy minimum, and (2) in most cases proteins fold to a unique state determined by their amino ...
Oswin Aichholzer, David Bremner, Erik D. Demaine, ...