2270 search results - page 126 / 454 » On the distribution of eigenvalues of graphs |
193
click to vote
HIPC
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
151
click to vote
HCW
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
164
click to vote
ISCOPE
1999
Springer
15 years 10 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
196
click to vote
IPSN
2005
Springer
15 years 12 months ago
2005
Springer
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
197
click to vote
TC
2010
15 years 4 months ago
2010
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...