5046 search results - page 807 / 1010 » Non-redundant data clustering |
164
click to vote
SOSP
1997
ACM
15 years 8 months ago
1997
ACM
A common problem facing mobile computing is disconnected operation, or computing in the absence of a network. Hoarding eases disconnected operation by selecting a subset of the us...
205
click to vote
WWW
2010
ACM
15 years 7 months ago
2010
ACM
We study the problem of anonymizing user profiles so that user privacy is sufficiently protected while the anonymized profiles are still effective in enabling personalized web sea...
231
click to vote
COMCOM
2008
15 years 7 months ago
2008
Underwater wireless sensor networks consist of a certain number of sensors and vehicles that interact to collect data and perform collaborative tasks. Designing energy-efficient r...
159
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
181
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...