Sciweavers

925 search results - page 5 / 185
» Connectivity on Complete Lattices
Sort
View
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
13 years 5 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
APLAS
2007
ACM
13 years 9 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
BMCBI
2008
211views more  BMCBI 2008»
13 years 5 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
JCAM
2011
78views more  JCAM 2011»
12 years 8 months ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters
APAL
2008
79views more  APAL 2008»
13 years 5 months ago
Intermediate logics and factors of the Medvedev lattice
We investigate the initial segments of the Medvedev lattice as Brouwer algebras, and study the propositional logics connected to them.
Andrea Sorbi, Sebastiaan Terwijn