3958 search results - page 192 / 792 » Dynamic Graph Algorithms with Applications |
195
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
164
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
187
click to vote
JGAA
2002
15 years 6 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
179
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
To support incremental replay of message-passing applications, processes must periodically checkpoint and the content of some messages must be logged, to break dependencies of the...
169
click to vote
DASFAA
2009
IEEE
16 years 1 months ago
2009
IEEE
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...