308 search results - page 9 / 62 » How Fast Is the k-Means Method |
186
Voted
CIKM
2005
Springer
15 years 5 months ago
2005
Springer
Inverted index structures are the mainstay of modern text retrieval systems. They can be constructed quickly using off-line mergebased methods, and provide efficient support for ...
136
Voted
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
: 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...
140
Voted
ISVC
2009
Springer
15 years 10 months ago
2009
Springer
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
124
Voted
SBBD
2000
15 years 5 months ago
2000
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
119
Voted
CCGRID
2005
IEEE
15 years 9 months ago
2005
IEEE
The ability to quickly predict the throughput of a TCP transfer between a client and a server, or between peers, has wide application in scientific computing and commercial compu...