1222 search results - page 93 / 245 » corr 2008 |
165
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In Graph Minors III, Robertson and Seymour write:"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal -- indeed, w...
158
click to vote
CORR
2008
Springer
15 years 6 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...
142
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
How many moves does it take to solve Rubik's Cube? Positions are known that require 20 moves, and it has already been shown that there are no positions that require 27 or mor...
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we consider the problem of robust joint source-channel coding over an additive white Gaussian noise channel. We propose a new scheme which achieves the optimal slope...
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...