5595 search results - page 740 / 1119 » Approximation Algorithms for Clustering Problems |
180
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
172
click to vote
CISS
2007
IEEE
16 years 1 months ago
2007
IEEE
— We propose an expectation-maximization (EM) technique for locating multiple transmitters based on power levels observed by a set of arbitrarily-placed receivers. Multiple trans...
138
click to vote
EMSOFT
2005
Springer
16 years 10 days ago
2005
Springer
An advanced communication system, the FlexRay system, has been developed for future automotive applications. It consists of time-triggered clusters, such as drive-by-wire in cars,...
176
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
173
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
We investigate explicit segment duration models in addressing the problem of fragmentation in musical audio segmentation. The resulting probabilistic models are optimised using Mar...