3958 search results - page 637 / 792 » Dynamic Graph Algorithms with Applications |
122
click to vote
ACMMSP
2004
ACM
15 years 8 months ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
103
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
156
click to vote
WIDM
2004
ACM
15 years 8 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
116
click to vote
ISPD
1999
ACM
15 years 6 months ago
1999
ACM
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
137
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...