5606 search results - page 649 / 1122 » Randomization Techniques for Graphs. |
165
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
180
click to vote
IJNSEC
2006
15 years 7 months ago
2006
Batch verification can provide large computational savings when multiple signatures are verified together. Recently, some batch verifying signature schemes have been proposed from...
201
click to vote
TSP
2008
15 years 6 months ago
2008
We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Conne...
210
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
168
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...