420 search results - page 70 / 84 » Discrete mobile centers |
143
click to vote
ICC
2009
IEEE
16 years 4 days 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 ...
171
click to vote
CIKM
2007
Springer
15 years 11 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...
158
click to vote
COMPGEOM
2006
ACM
15 years 11 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...
145
click to vote
COMPGEOM
2003
ACM
15 years 10 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...
140
click to vote
STOC
1991
ACM
15 years 9 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...