534 search results - page 60 / 107 » Diameter critical graphs |
149
click to vote
CCGRID
2006
IEEE
16 years 10 days ago
2006
IEEE
Abstract— An efficient, accurate and distributed metadataoriented prefetching scheme is critical to the overall performance in large distributed storage systems. In this paper, ...
142
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
139
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
In this paper we consider the p-ary transitive reduction (TRp) problem where p > 0 is an integer; for p = 2 this problem arises in inferring a sparsest possible (biological) sig...
187
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
166
click to vote
PVLDB
2010
15 years 4 months ago
2010
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...