12741 search results - page 329 / 2549 » Editorial and call for papers |
170
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
150
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling...
174
click to vote
DCC
2010
IEEE
15 years 7 months ago
2010
IEEE
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
198
click to vote
DAM
2008
15 years 7 months ago
2008
In comparative genomics, one wishes to deduce the evolutionary distance between dierent species by studying their genomes. Using gene order information, we seek the number of time...
177
click to vote
DAM
2008
15 years 7 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...