2600 search results - page 64 / 520 » Clustering with or without the Approximation |
113
click to vote
TNN
2010
14 years 4 months ago
2010
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper we focus on an interpretation of Gaussian radial basis functions (GRBF) which motivates extensions and learning strategies. Specifically, we show that GRBF regressio...
SIBGRAPI
2003
IEEE
15 years 3 months ago
2003
IEEE
We describe a new method for surface reconstruction based on unorganized point clouds without normals. We also present a new algorithm for refining the inital triangulation. The o...
DCC
1993
IEEE
15 years 1 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...