1161 search results - page 83 / 233 » Approximation schemes for clustering problems |
135
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
116
click to vote
QUESTA
2007
15 years 3 months ago
2007
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
145
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we consider the problem of manifold approximation with affine subspaces. Our objective is to discover a set of low dimensional affine subspaces that represents ma...
154
Voted
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
147
Voted
COLOGNETWENTE
2007
15 years 5 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...