791 search results - page 73 / 159 » Approximating the Maximum Sharing Problem |
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
GI
2009
Springer
13 years 5 months ago
2009
Springer
: This paper describes the passive emitter localization using Time Difference of Arrival (TDOA) measurements. It investigates various methods for estimating the solution of this no...
FOCS
1997
IEEE
13 years 12 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...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...