791 search results - page 64 / 159 » Approximating the Maximum Sharing Problem |
ALT
2008
Springer
14 years 4 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
ICC
2000
IEEE
14 years 4 days ago
2000
IEEE
Abstract – In this work we consider the problem of locating a known periodically embedded synchronization pattern in random data, which is subject to flat fading and additive wh...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
MOBIHOC
2010
ACM
13 years 5 months ago
2010
ACM
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...