7015 search results - page 301 / 1403 » Approximation algorithms for co-clustering |
179
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
157
click to vote
IPL
2002
15 years 6 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
175
click to vote
NA
2007
15 years 6 months ago
2007
Many radial basis function (RBF) methods contain a free shape parameter that plays an important role for the accuracy of the method. In most papers the authors end up choosing this...
224
click to vote
JMLR
2010
15 years 1 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
164
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We present a novel algorithm for approximating the parameters of a multivariate t-distribution. At the expense of a slightly decreased accuracy in the estimates, the prop...