237 search results - page 13 / 48 » Finding Metric Structure in Information Theoretic Clustering |
CORR
2010
Springer
14 years 4 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. ...
102
click to vote
TMC
2010
14 years 8 months ago
2010
—In wireless networks, node cooperation has been exploited as a data relaying mechanism for decades. However, the wireless channel allows for much richer interaction among nodes....
IPM
2006
14 years 9 months ago
2006
Both structured and unstructured data, as well as structured data representing several different types of tuples, may be integrated into a single list for browsing or retrieval. D...
BMCBI
2008
14 years 9 months ago
2008
Background: DNA microarray technology allows for the measurement of genome-wide expression patterns. Within the resultant mass of data lies the problem of analyzing and presenting...
66
Voted
PR
2007
14 years 9 months ago
2007
This paper presents a direct method for finding corresponding pairs of parts between two shapes. Statistical knowledge about a large number of parts from many different objects is...