3958 search results - page 221 / 792 » Dynamic Graph Algorithms with Applications |
285
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
196
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Software distributed shared memory (DSM) techniques, while effective on applications with coarse-grained sharing, yield poor performance for the fine-grained sharing encountered i...
181
click to vote
ICALP
2005
Springer
16 years 3 days ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
191
click to vote
PEPM
2007
ACM
16 years 21 days ago
2007
ACM
Functional Reactive Programming (frp) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style...
165
click to vote
DSD
2007
IEEE
16 years 28 days ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...