3958 search results - page 53 / 792 » Dynamic Graph Algorithms with Applications |
131
Voted
SIGKDD
2008
15 years 2 months ago
2008
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
262
click to vote
SDM
2011
SIAM
14 years 5 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
114
Voted
ENTCS
2007
15 years 2 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
111
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
115
Voted
DSD
2010
IEEE
15 years 2 months ago
2010
IEEE
—The design of new embedded systems is getting more and more complex as more functionality is integrated into these systems. To deal with the design complexity, a predictable des...