6598 search results - page 341 / 1320 » Graph Theory with Applications |
182
click to vote
IFIP12
2007
15 years 8 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
189
click to vote
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
178
click to vote
ISSS
2000
IEEE
15 years 11 months ago
2000
IEEE
Even though high-level hardware synthesis from dataflow graphs becomes popular in designing DSP systems, currently used dataflow models are inefficient to deal with emerging multi...
164
click to vote
DEXA
2007
Springer
15 years 10 months ago
2007
Springer
Whenever Ajax applications on mobile devices have to retrieve large XML data fragments from a remote server, a reduction of the exchanged data volume may be crucial to manage limit...
170
click to vote
ESCIENCE
2007
IEEE
16 years 1 months ago
2007
IEEE
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...