3958 search results - page 296 / 792 » Dynamic Graph Algorithms with Applications |
209
click to vote
EDBT
2012
ACM
13 years 9 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
198
click to vote
IEEEPACT
1997
IEEE
15 years 11 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
198
click to vote
CGO
2004
IEEE
15 years 10 months ago
2004
IEEE
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
175
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
Link analysis methods have been used successfully for knowledge discovery from the link structure of mutually linking entities. Existing link analysis methods have been inherently...
229
click to vote
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...