791 search results - page 64 / 159 » Approximating the Maximum Sharing Problem |
126
Voted
ALT
2008
Springer
15 years 11 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...
82
Voted
ICC
2000
IEEE
15 years 7 months 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...
104
click to vote
CORR
2004
Springer
15 years 2 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...
141
click to vote
FOCS
2008
IEEE
15 years 9 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...
114
Voted
MOBIHOC
2010
ACM
15 years 19 days 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 ...