4074 search results - page 320 / 815 » Abstract Graph Transformation |
169
click to vote
UC
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
142
click to vote
WEA
2005
Springer
16 years 3 days ago
2005
Springer
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
145
click to vote
ER
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. Deploying process-driven information systems is a time-consuming and error-prone task. Process mining attempts to improve this by automatically generating a process model...
223
click to vote
SCOPES
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
188
click to vote
ECCV
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...