2489 search results - page 31 / 498 » On the Subgroup Distance Problem |
99
Voted
LCN
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we propose a novel framework for secure multicast on overlay networks. Our contributions are threefold: 1) a technique key composition is proposed to cope with the ...
146
click to vote
HSNMC
2003
Springer
15 years 6 months ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
71
Voted
DAM
2008
15 years 27 days ago
2008
We interpret the reciprocation process in K[[x]] as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamic...
101
click to vote
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
114
click to vote
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...