5595 search results - page 48 / 1119 » Approximation Algorithms for Clustering Problems |
108
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
136
click to vote
ISAAC
1998
Springer
15 years 6 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
158
Voted
WAOA
2004
Springer
15 years 8 months ago
2004
Springer
92
Voted
SODA
1998
ACM
15 years 4 months ago
1998
ACM
131
click to vote
ALGORITHMICA
2005
15 years 2 months ago
2005
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...