28 search results - page 3 / 6 » Some Remarks on Definability of Process Graphs |
ECEASST
2008
13 years 7 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
GECCO
2003
Springer
14 years 19 days ago
2003
Springer
Initial results have been achieved for automatic synthesis of MEMS system-level lumped parameter models using genetic programming and bond graphs. This paper first discusses the ne...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
ECOOPW
1997
Springer
13 years 11 months ago
1997
Springer
The traditional workflow process model is typically illustrated with a graph of activities, tasks, deliverables and techniques. From an object-oriented perspective, every identifi...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...