Sciweavers

709 search results - page 9 / 142
» In-stroke word completion
Sort
View
CORR
2008
Springer
104views Education» more  CORR 2008»
14 years 12 months ago
A General Framework for Sound and Complete Floyd-Hoare Logics
er presents an abstraction of Hoare logic to traced symmetric monoidal categories, a eral framework for the theory of systems. Our abstraction is based on a traced monoidal functor...
Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paul...
DM
2010
117views more  DM 2010»
14 years 12 months ago
The distinguishing chromatic number of Cartesian products of two complete graphs
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
Janja Jerebic, Sandi Klavzar
JDA
2007
83views more  JDA 2007»
14 years 11 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
SIAMDM
1998
102views more  SIAMDM 1998»
14 years 11 months ago
A New Decoding Algorithm for Complete Decoding of Linear Block Codes
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
Yunghsiang S. Han
JSC
2010
102views more  JSC 2010»
14 years 10 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu