169 search results - page 31 / 34 » Distributed Approximation Algorithms for Finding 2-Edge-Conn... |
SSD
2007
Springer
14 years 1 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
MOBIHOC
2008
ACM
14 years 6 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
NN
2002
Springer
13 years 7 months ago
2002
Springer
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
NIPS
2000
13 years 8 months ago
2000
We describe a neurally-inspired, unsupervised learning algorithm that builds a non-linear generative model for pairs of face images from the same individual. Individuals are then ...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...