1095 search results - page 122 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
110
Voted
ICDCSW
2005
IEEE
15 years 8 months ago
2005
IEEE
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
146
Voted
ICCV
2009
IEEE
15 years 15 days ago
2009
IEEE
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
146
Voted
ICS
2004
Tsinghua U.
15 years 8 months ago
2004
Tsinghua U.
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
110
Voted
DAC
2001
ACM
16 years 3 months ago
2001
ACM
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...
97
Voted
ISPA
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...