991 search results - page 55 / 199 » The query-flow graph: model and applications |
274
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
177
click to vote
HASE
1999
IEEE
15 years 10 months ago
1999
IEEE
The state of the art in verifying the real-time requirements of applications developed using general processing graph models relies on simulation or off-line scheduling. We extend...
210
click to vote
WSDM
2012
ACM
14 years 1 months ago
2012
ACM
In this work we propose a novel approach to anomaly detection in streaming communication data. We first build a stochastic model for the system based on temporal communication pa...
177
click to vote
SIGDOC
2000
ACM
15 years 10 months ago
2000
ACM
We address two problems of technical authors in structured environments: (1) Structure definitions of the SGML school are limiting: they require one primary hierarchy and do not c...
194
click to vote
ICPADS
1998
IEEE
15 years 10 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...