1279 search results - page 94 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
152
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
145
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
155
click to vote
WWW
2011
ACM
14 years 11 months ago
2011
ACM
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
127
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
154
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...