1477 search results - page 95 / 296 » On Graph Problems in a Semi-streaming Model |
103
click to vote
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
113
click to vote
DEDS
2010
15 years 1 months ago
2010
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
101
click to vote
MM
2010
ACM
15 years 1 months ago
2010
ACM
Image classification is a well-studied and hard problem in computer vision. We extend a proven solution for classifying web spam to handle images. We exploit the link structure of...
115
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...
132
Voted
DAC
2007
ACM
16 years 2 months ago
2007
ACM
Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guarante...