9997 search results - page 421 / 2000 » The case for crowd computing |
179
click to vote
DCC
1993
IEEE
15 years 11 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
179
click to vote
TLCA
1993
Springer
15 years 11 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
167
click to vote
DAC
1990
ACM
15 years 11 months ago
1990
ACM
In this paper, we provide an overview of a system designed for verifying the consistency of timing specifications for digital circuits. The utility of the system comes from the ne...
131
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
A guiding question in the study of weak 2-randomness is whether weak 2-randomness is closer to 1-randomness, or closer to 2randomness. Recent research indicates that the first alte...
195
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...