Sciweavers

25 search results - page 2 / 5
» Bregman Clustering for Separable Instances
Sort
View
PAMI
2006
128views more  PAMI 2006»
13 years 4 months ago
On Weighting Clustering
Recent papers and patents in iterative unsupervised learning have emphasized a new trend in clustering. It basically consists of penalizing solutions via weights on the instance po...
Richard Nock, Frank Nielsen
IJCNN
2008
IEEE
13 years 11 months ago
Two-level clustering approach to training data instance selection: A case study for the steel industry
— Nowadays, huge amounts of information from different industrial processes are stored into databases and companies can improve their production efficiency by mining some new kn...
Heli Koskimäki, Ilmari Juutilainen, Perttu La...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 4 months ago
Microlocal Analysis of the Geometric Separation Problem
Image data are often composed of two or more geometrically distinct constituents; in galaxy catalogs, for instance, one sees a mixture of pointlike structures (galaxy supercluster...
David L. Donoho, Gitta Kutyniok
TOG
2010
156views more  TOG 2010»
12 years 11 months ago
Style-content separation by anisotropic part scales
We perform co-analysis of a set of man-made 3D objects to allow the creation of novel instances derived from the set. We analyze the objects at the part level and treat the anisot...
Kai Xu 0004, Honghua Li, Hao Zhang 0002, Daniel Co...
CP
2010
Springer
13 years 2 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex