Sciweavers

925 search results - page 30 / 185
» Connectivity on Complete Lattices
Sort
View
ASIAN
1998
Springer
118views Algorithms» more  ASIAN 1998»
15 years 4 months ago
Bisimulation Lattice of Chi Processes
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...
Yuxi Fu
CAV
2012
Springer
222views Hardware» more  CAV 2012»
13 years 2 months ago
Leveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
Simone Fulvio Rollini, Ondrej Sery, Natasha Sharyg...
ICFCA
2007
Springer
15 years 6 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...
ICPP
1994
IEEE
15 years 4 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández
ICIP
2005
IEEE
16 years 1 months ago
Bounding box splitting for robust shape classification
This paper presents a fast method to compute homeomorphisms between 2D lattices and shapes found in binary images. Unlike many other methods, this mapping is not restricted to sim...
Christian Bauckhage, John K. Tsotsos