192 search results - page 35 / 39 » Visualizing Data with Bounded Uncertainty |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
SP
2002
IEEE
13 years 7 months ago
2002
IEEE
A suite of scalable atomistic simulation programs has been developed for materials research based on space-time multiresolution algorithms. Design and analysis of parallel algorit...
TVCG
2010
13 years 5 months ago
2010
—Crease surfaces are two-dimensional manifolds along which a scalar field assumes a local maximum (ridge) or a local minimum (valley) in a constrained space. Unlike isosurfaces, ...
CVPR
2009
IEEE
14 years 11 months ago
2009
IEEE
Color is a powerful visual cue for many computer vision
applications such as image segmentation and object recognition.
However, most of the existing color models depend on the i...