1594 search results - page 203 / 319 » An Algorithm to Compute Collusion Paths |
140
click to vote
PPOPP
1999
ACM
15 years 7 months ago
1999
ACM
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
132
Voted
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
116
Voted
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
We describe a system for generating coherent movies from a collection of unedited videos. The generation process is guided by one or more input keyframes, which determine the cont...
132
Voted
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
109
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...