2137 search results - page 170 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
156
click to vote
ISAAC
2007
Springer
16 years 14 days ago
2007
Springer
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
178
Voted
SIAMCOMP
1998
15 years 6 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
153
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
160
click to vote
COLING
2008
15 years 7 months ago
2008
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
204
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...