308 search results - page 11 / 62 » How Fast Is the k-Means Method |
153
Voted
PKDD
2000
Springer
15 years 7 months ago
2000
Springer
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
208
click to vote
VCBM
2010
14 years 10 months ago
2010
We present a fast and interactive segmentation method for medical images that allows a smooth reconstruction of an object's surface from a set of user drawn, three-dimensiona...
175
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
132
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: The imprint of natural selection on gene sequences is often difficult to detect. A plethora of methods have been devised to detect genetic changes due to selective pro...
112
Voted
WSC
2008
15 years 6 months ago
2008
In today's global marketplace, the information associated with a product is fast becoming a critical link in the supply chain. Especially in fast moving consumer goods (FMCGs...