Sciweavers

747 search results - page 82 / 150
» Theory and Construction of Molecular Computers
Sort
View
AAAI
2008
13 years 10 months ago
Reasoning about Large Taxonomies of Actions
We design a representation based on the situation calculus to facilitate development, maintenance and elaboration of very large taxonomies of actions. This representation leads to...
Yilan Gu, Mikhail Soutchanski
SIAMAM
2002
129views more  SIAMAM 2002»
13 years 8 months ago
Periodic Wavelet Transforms and Periodicity Detection
The theory of periodic wavelet transforms presented here was originally developed to deal with the problem of epileptic seizure prediction. A central theorem in the theory is the c...
Götz E. Pfander, John J. Benedetto
EUROPAR
2006
Springer
14 years 14 days ago
Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
DCC
2011
IEEE
13 years 3 months ago
The cocyclic Hadamard matrices of order less than 40
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. Thi...
Padraig Ó Catháin, Marc Röder
CORR
2004
Springer
90views Education» more  CORR 2004»
13 years 8 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