1029 search results - page 74 / 206 » Compact representations of ordered sets |
147
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
138
click to vote
ALMOB
2007
15 years 3 months ago
2007
Background: Some amino acid residues functionally interact with each other. This interaction will result in an evolutionary co-variation between these residues – coevolution. Ou...
148
Voted
VISUALIZATION
2002
IEEE
15 years 8 months ago
2002
IEEE
Typically 3-D MR and CT scans have a relatively high resolution in the scanning X;Y plane, but much lower resolution in the axial Z direction. This non-uniform sampling of an obje...
108
click to vote
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
165
Voted
STOC
2002
ACM
16 years 3 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...