10 search results - page 2 / 2 » On Senary Simplex Codes |
TIT
2002
13 years 5 months ago
2002
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
CLUSTER
2008
IEEE
14 years 13 days ago
2008
IEEE
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
CVPR
2003
IEEE
13 years 11 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
ESA
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
CRYPTO
2001
Springer
13 years 10 months ago
2001
Springer
An (n, m, k)-resilient function is a function f : Fn 2 → Fm 2 such that every possible output m-tuple is equally likely to occur when the values of k arbitrary inputs are fixed ...