694 search results - page 53 / 139 » Open Graphs and Computational Reasoning |
EUROPAR
2007
Springer
14 years 4 months ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
EC
1998
13 years 9 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
EDBT
2012
ACM
12 years 17 days ago
2012
ACM
We present some architectural and technological insights on SAP’s HANA database and derive research challenges for future enterprise application development. The HANA database m...
CVPR
2001
IEEE
15 years 5 days ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
DAC
2006
ACM
14 years 11 months ago
2006
ACM
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...