1332 search results - page 5 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
PAA
2006
13 years 7 months ago
2006
Abstract In this paper, an efficient K-medians clustering (unsupervised) algorithm for prototype selection and Supervised K-medians (SKM) classification technique for protein seque...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
MOR
2006
13 years 7 months ago
2006
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
AAAI
2010
13 years 8 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...