Sciweavers

7758 search results - page 58 / 1552
» On the Number of Distributive Lattices
Sort
View
ORDER
2008
86views more  ORDER 2008»
13 years 8 months ago
Comparison of MacNeille, Canonical, and Profinite Completions
Using duality theory, we give necessary and sufficient conditions for the MacNeille, canonical, and profinite completions of distributive lattices, Heyting algebras, and Boolean al...
Guram Bezhanishvili, Jacob Vosmaer
TIT
2008
83views more  TIT 2008»
13 years 8 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
ESANN
2000
13 years 10 months ago
Self-Organisation in the SOM with a finite number of possible inputs
Abstract. Given a one dimensional SOM with a monotonically decreasing neighbourhood and an input distribution which is not Lebesque continuous, a set of su cient conditions and a T...
John A. Flanagan
PODC
1999
ACM
14 years 1 months ago
Liveness-Preserving Simulation Relations
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...
Paul C. Attie
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
14 years 27 days ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill