1595 search results - page 59 / 319 » A hierarchical clustering algorithm based on the Hungarian m... |
172
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
168
click to vote
IS
2006
15 years 6 months ago
2006
The processing and management of XML data are popular research issues. However, operations based on the structure of XML data have not received strong attention. These operations ...
342
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
191
click to vote
CEE
2011
14 years 9 months ago
2011
Performance of ad hoc networks dramatically declines as network grows. Cluster formation in which the network hosts are hierarchically part...
157
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: Grouping proteins into sequence-based clusters is a fundamental step in many bioinformatic analyses (e.g., homology-based prediction of structure or function). Standar...