1105 search results - page 114 / 221 » Approximate Spectral Clustering. |
94
Voted
CJ
2010
15 years 27 days ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
122
Voted
TALG
2010
14 years 7 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
87
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
113
click to vote
SYNASC
2006
IEEE
15 years 6 months ago
2006
IEEE
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
129
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
This work presents an automatic technique for detection of abnormal events in crowds. Crowd behaviour is difficult to predict and might not be easily semantically translated. More...