794 search results - page 58 / 159 » Challenges in Parallel Graph Processing |
CONCUR
2006
Springer
14 years 24 days ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
CONCUR
2010
Springer
13 years 10 months ago
2010
Springer
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
LION
2009
Springer
14 years 3 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
DAGM
2006
Springer
14 years 22 days ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...