Sciweavers

77 search results - page 13 / 16
» A note on single-linkage equivalence
Sort
View
AGI
2008
13 years 11 months ago
Engineering Utopia
The likely advent of AGI and the long-established trend of improving computational hardware promise a dual revolution in coming decades: machines which are both more intelligent an...
J. Storrs Hall
TCS
2010
13 years 8 months ago
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
Katerina Asdre, Stavros D. Nikolopoulos
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 10 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
AC
2000
Springer
14 years 2 months ago
The Join Calculus: A Language for Distributed Mobile Programming
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
Cédric Fournet, Georges Gonthier
TACS
1994
Springer
14 years 1 months ago
Syntactic Definitions of Undefined: On Defining the Undefined
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
Zena M. Ariola, Richard Kennaway, Jan Willem Klop,...