3265 search results - page 455 / 653 » Representing Groups on Graphs |
190
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
213
click to vote
ISSTA
2012
ACM
13 years 9 months ago
2012
ACM
We introduce a static detector, Saber, for detecting memory leaks in C programs. Leveraging recent advances on sparse pointer analysis, Saber is the first to use a full-sparse va...
174
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. Successful multi-target tracking requires solving two problems - localize the targets and label their identity. An isolated target's identity can be unambiguously pr...
280
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
205
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...