2600 search results - page 63 / 520 » Clustering with or without the Approximation |
NIPS
2008
14 years 11 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
DASFAA
2009
IEEE
15 years 4 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
ICML
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose a deterministic method to evaluate the integral of a positive function based on soft-binning functions that smoothly cut the integral into smaller integrals that are ea...
ESANN
2008
14 years 11 months ago
2008
The evaluation of a standard Gaussian process regression model takes time linear in the number of training data points. In this paper, the models are approximated in the feature sp...