Sciweavers

1055 search results - page 54 / 211
» Enumerations in computable structure theory
Sort
View
CVPR
2010
IEEE
14 years 6 months ago
Image Webs: Computing and Exploiting Connectivity in Image Collections
The widespread availability of digital cameras and ubiquitous Internet access have facilitated the creation of massive image collections. These collections can be highly interconn...
Kyle Heath
FCS
2006
13 years 11 months ago
Algorithmic Control in Concurrent Computations
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
Mark Burgin
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
14 years 3 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
MFCS
2007
Springer
14 years 4 months ago
Properties Complementary to Program Self-reference
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...
John Case, Samuel E. Moelius

Lecture Notes
832views
15 years 8 months ago
Sorting and Searching Algorithms: A Cookbook
"This is a collection of algorithms for sorting and searching. Descriptions are brief and intuitive, with just enough theory thrown in to make you nervous. I assume you know C...
THOMAS NIEMANN