Sciweavers

2174 search results - page 213 / 435
» cluster 2007
Sort
View
NIPS
2003
15 years 8 months ago
Sample Propagation
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
Mark A. Paskin
MVA
1996
205views Computer Vision» more  MVA 1996»
15 years 7 months ago
Highlight Separation Using Multiple Images with Intensities and Ranges.
In this paper, a method for extracting influences of specular reflection and shade from multiple color images is described. As regards extraction, the di-chromatic reflection mode...
Masaki Otsuki, Yukio Sato
IM
2008
15 years 6 months ago
The Structure of Geographical Threshold Graphs
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 6 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri
APIN
2000
87views more  APIN 2000»
15 years 6 months ago
The Architecture and Performance of a Stochastic Competitive Evolutionary Neural Tree Network
: A new dynamic tree structured network - the Stochastic Competitive Evolutionary Neural Tree (SCENT) is introduced. The network is able to provide a hierarchical classification of...
Neil Davey, Rod Adams, Stella J. George