1632 search results - page 84 / 327 » Sublinear Time Algorithms for Metric Space Problems |
135
Voted
SODA
2010
ACM
16 years 28 days ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
139
Voted
ICDCS
2008
IEEE
15 years 10 months ago
2008
IEEE
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
163
Voted
CSDA
2007
15 years 3 months ago
2007
In blind source separation, there are M sources that produce sounds independently and continuously over time. These sounds are then recorded by m receivers. The sound recorded by ...
106
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
139
click to vote
MICAI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...