Sciweavers

7 search results - page 2 / 2
» Minimum sized text containment shapes
Sort
View
TPDS
1998
92views more  TPDS 1998»
13 years 6 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 7 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...