1059 search results - page 30 / 212 » Improved Algorithms via Approximations of Probability Distri... |
88
Voted
WADS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
132
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
ECML
2005
Springer
15 years 3 months ago
2005
Springer
Active selection of good training examples is an important approach to reducing data-collection costs in machine learning; however, most existing methods focus on maximizing classi...
ICNP
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...