539 search results - page 47 / 108 » The N R One Time Password System |
MPC
2010
Springer
15 years 1 months ago
2010
Springer
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
RSA
2000
14 years 9 months ago
2000
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
104
click to vote
SODA
2010
ACM
14 years 8 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Consider a generic data unit of random size L that needs to be transmitted over a channel of unit capacity. The channel dynamics is modeled as an on-off process {(Ai, Ui)}i≥1...