Sciweavers

327 search results - page 31 / 66
» Algorithms for infinite huffman-codes
Sort
View
DCC
2008
IEEE
14 years 8 months ago
Williamson matrices up to order 59
A recent result of Schmidt has brought Williamson matrices back into the spotlight. In this paper a new algorithm is introduced to search for hard to find Williamson matrices. We ...
Wolf H. Holzmann, Hadi Kharaghani, Behruz Tayfeh-R...
SIGCSE
2000
ACM
169views Education» more  SIGCSE 2000»
14 years 26 days ago
Design patterns for lazy evaluation
We propose an object-oriented (OO) formulation and implementation of lazy/delayed evaluation by reusing and extending an existing linear recursive structure (LRS) framework with t...
Dung Zung Nguyen, Stephen B. Wong
CSR
2006
Springer
14 years 6 days ago
Constructive Equivalence Relations on Computable Probability Measures
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
Laurent Bienvenu
BIRTHDAY
2008
Springer
13 years 10 months ago
From Monadic Logic to PSL
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...
Moshe Y. Vardi
AAAI
2000
13 years 10 months ago
Semantics and Inference for Recursive Probability Models
In recent years, there have been several proposals that extend the expressive power of Bayesian networks with that of relational models. These languages open the possibility for t...
Avi Pfeffer, Daphne Koller