3096 search results - page 87 / 620 » The Generalized FITC Approximation |
DAGSTUHL
2007
13 years 10 months ago
2007
We address the problem of finding sparse wavelet representations of high-dimensional vectors. We present a lower-bounding technique and use it to develop an algorithm for computi...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
CATS
2006
13 years 10 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...