Sciweavers

1420 search results - page 184 / 284
» Representation of Graphs by OBDDs
Sort
View
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
15 years 12 months ago
Temporal floorplanning using 3D-subTCG
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang, Hsin-...
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 11 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
GLVLSI
2002
IEEE
95views VLSI» more  GLVLSI 2002»
15 years 11 months 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
SSPR
1998
Springer
15 years 10 months ago
Object Recognition from Large Structural Libraries
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
Benoit Huet, Edwin R. Hancock
PLDI
1994
ACM
15 years 10 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali