2520 search results - page 109 / 504 » The complexity of approximating entropy |
ESA
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
ICIP
2008
IEEE
16 years 3 days ago
2008
IEEE
We propose a block-based transform optimization and associated image compression technique that exploits regularity along directional image singularities. Unlike established work,...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
105
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
127
click to vote
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...