Sciweavers

371 search results - page 12 / 75
» Partition Theorems and Computability Theory
Sort
View
LICS
2002
IEEE
15 years 2 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
CADE
2006
Springer
15 years 10 months ago
Automatic Construction and Verification of Isotopy Invariants
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
Volker Sorge, Andreas Meier, Roy L. McCasland, Sim...

Book
1709views
16 years 7 months ago
The Theory and Technique of Electronic Music
"This is a book about using electronic techniques to record, synthesize, process, and analyze musical sounds, a practice which came into its modern form in the years 1948-19...
Miller Puckette
EUROPAR
2006
Springer
15 years 1 months 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...
GD
2006
Springer
15 years 1 months ago
Partitions of Graphs into Trees
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
Therese C. Biedl, Franz-Josef Brandenburg