2463 search results - page 283 / 493 » Rankings of Directed Graphs |
140
Voted
CLUSTER
2006
IEEE
15 years 3 months ago
2006
IEEE
The Linux cluster considered in this paper, formed from shuttle box XPC nodes with 2 GHz Athlon processors connected by dual Gb Ethernet switches, is relatively easily constructed...
113
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
102
Voted
ICIAP
2003
ACM
16 years 3 months ago
2003
ACM
A novel approach is presented to select multiple key frames within an isolated video shot where there is camera motion causing significant scene change. This is achieved by determ...
148
click to vote
SAC
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we present our research result that enables users to navigate a very large social network and to take a look at information flows on the network. To this end, we d...
112
Voted
WEA
2009
Springer
15 years 10 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...