12459 search results - page 56 / 2492 » cans 2006 |
CCCG
2006
13 years 9 months ago
2006
We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.
COMPUTING
2006
13 years 7 months ago
2006
With respect to a wavelet basis, singular integral operators can be well approximated by sparse matrices, and in [Found. Comput. Math., 2 (2002), pp. 203
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Shannon proved that if we can transmit bits reliably at rates larger than the rate distortion function R(D), then we can transmit this source to within a distortion D. We answer th...
CANS
2006
Springer
13 years 11 months ago
2006
Springer
We propose a new computational complexity assumption from bilinear map, based on which we construct Verifier-Local Revocation group signatures with shorter lengths than previous on...
IVC
2006
13 years 7 months ago
2006
Palette reordering has been shown to be a very effective approach for improving the compression of color-indexed images by general purpose continuous-tone image coding techniques....