Sciweavers

1722 search results - page 60 / 345
» Variables in Concept Graphs
Sort
View
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
15 years 4 months ago
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Amir Shpilka, Ilya Volkovich
POPL
2003
ACM
15 years 10 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
SCP
2002
112views more  SCP 2002»
14 years 9 months ago
Formal agent-oriented modeling with UML and graph transformation
The agent paradigm can be seen as an extension of the notion of (active) objects by concepts like autonomy and cooperation. Mainstream object-oriented modeling techniques do not a...
Ralph Depke, Reiko Heckel, Jochen Malte Küste...

Publication
273views
13 years 8 months ago
 Beyond Graphs: A New Synthesis.
Artificial neural networks, electronic circuits, and gene networks are some examples of systems that can be modeled as networks, that is, as collections of interconnected nodes. I...
Mattiussi, Claudio, Dürr, Peter, Marbach, Daniel ...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
15 years 11 months ago
Graph Database Indexing Using Structured Graph Decomposition
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
David W. Williams, Jun Huan, Wei Wang 0010