15254 search results - page 27 / 3051 » A k |
JCSS
2002
13 years 9 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
DM
2010
13 years 8 months ago
2010
We determine all hyperplanes of the dual polar space DQ−(7, K) which arise from embedding. This extends one of the results of [5] to the infinite case.
PVLDB
2010
13 years 8 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
CVPR
2012
IEEE
12 years 6 days ago
2012
IEEE
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...