6142 search results - page 393 / 1229 » The Complexity of Partition Functions |
167
Voted
CSDA
2007
15 years 6 months ago
2007
In this paper, we propose a novel non-parametric clustering method based on non-parametric local shrinking. Each data point is transformed in such a way that it moves a specific ...
200
click to vote
CVIU
2007
15 years 6 months ago
2007
A Bayesian framework is proposed for stereo vision where solutions to both the model parameters and the disparity map are posed in terms of predictions of latent variables, given ...
180
click to vote
IVC
2007
15 years 6 months ago
2007
The problem of clustering is often addressed with techniques based on a Voronoi partition of the data space. Vector quantization is based on a similar principle, but it is a diffe...
168
click to vote
JAT
2002
15 years 6 months ago
2002
Let f C[-1, 1] change its convexity finitely many times, in the interval. We are interested in estimating the degree of approximation of f by polynomials which are coconvex with i...
164
click to vote
JAT
2010
15 years 5 months ago
2010
Sampling and reconstruction of generic multivariate functions is more efficient on non-Cartesian root lattices, such as the BCC (Body-Centered Cubic) lattice, than on the Cartesia...