231 search results - page 35 / 47 » Sublinear time approximate clustering |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
FLAIRS
2010
13 years 5 months ago
2010
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
CLA
2006
13 years 9 months ago
2006
The paper presents additional results on factorization by similarity of fuzzy concept lattices. A fuzzy concept lattice is a hierarchically ordered collection of clusters extracted...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...