Sciweavers

353 search results - page 11 / 71
» From graph states to two-graph states
Sort
View
TCS
2008
13 years 7 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
COMBINATORICS
2007
66views more  COMBINATORICS 2007»
13 years 7 months ago
The Tripartite Separability of Density Matrices of Graphs
The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed dens...
Zhen Wang, Zhixi Wang
ECCV
2010
Springer
14 years 28 days ago
Finding Semantic Structures in Image Hierarchies using Laplacian Graph Energy
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
IFIP
1992
Springer
13 years 12 months ago
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
Jochen Beister, Ralf Wollowski
GLVLSI
2002
IEEE
95views VLSI» more  GLVLSI 2002»
14 years 25 days ago
Term ordering problem on MDG
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
Yi Feng, Eduard Cerny