420 search results - page 70 / 84 » Discrete mobile centers |
ICC
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...
CIKM
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
COMPGEOM
2003
ACM
14 years 2 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
STOC
1991
ACM
14 years 1 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...