Sciweavers

7758 search results - page 83 / 1552
» On the Number of Distributive Lattices
Sort
View
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
14 years 2 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
GLOBECOM
2008
IEEE
13 years 10 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu
JSC
2000
117views more  JSC 2000»
13 years 9 months ago
Goals and Benchmarks for Automated Map Reasoning
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...
Andrea Formisano, Eugenio G. Omodeo, Marco Temperi...
IEEEHPCS
2010
13 years 8 months ago
An FPGA design for the stochastic Greenberg-Hastings cellular automata
The stochastic Greenberg-Hastings cellular automaton is a model that mimics the propagation of reaction-diffusion waves in active media. Notably, this model undergoes a phase tran...
Nikolaos Vlassopoulos, Nazim Fatès, Hugues ...
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 7 months ago
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
Christine A. Kelley, Jörg Kliewer