628 search results - page 108 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
131
click to vote
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
128
Voted
EUROPAR
2008
Springer
15 years 4 months ago
2008
Springer
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
188
click to vote
FOCS
1997
IEEE
15 years 6 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
108
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
99
Voted
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...