Sciweavers

179 search results - page 34 / 36
» On Approximating the Average Distance Between Points
Sort
View
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 7 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin
NIPS
2001
13 years 8 months ago
Global Coordination of Local Linear Models
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
Sam T. Roweis, Lawrence K. Saul, Geoffrey E. Hinto...
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 7 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
MOBICOM
2009
ACM
14 years 1 months ago
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
Gaurav S. Kasbekar, Yigal Bejerano, Saswati Sarkar
ICPR
2006
IEEE
14 years 1 months ago
Fast Linear Discriminant Analysis Using Binary Bases
Linear Discriminant Analysis (LDA) is a widely used technique for pattern classification. It seeks the linear projection of the data to a low dimensional subspace where the data ...
Feng Tang, Hai Tao