2600 search results - page 132 / 520 » Clustering with or without the Approximation |
159
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
180
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
180
click to vote
SISAP
2010
IEEE
15 years 4 months ago
2010
IEEE
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
173
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
Many mathematical models involve flow equations characterized by nonconstant viscosity, and a Stokes type problem with variable viscosity coefficient arises. Appropriate block diag...
181
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...