217 search results - page 14 / 44 » Providing Serializability for Pregel-like Graph Processing S... |
153
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
115
Voted
BMVC
2000
15 years 4 months ago
2000
We address the problem of object recognition in computer vision. We represent each model and the scene in the form of Attributed Relational Graph. A multiple region representation...
131
Voted
DAC
2008
ACM
16 years 4 months ago
2008
ACM
Synchronous dataflow (SDF) has been successfully used in design tools for system-level simulation of wireless communication systems. Modern wireless communication standards involv...
DAC
2009
ACM
16 years 4 months ago
2009
ACM
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
151
Voted
SPIN
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...