539 search results - page 7 / 108 » The N R One Time Password System |
SIAMCOMP
2012
11 years 9 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
IJCAI
1989
13 years 8 months ago
1989
This theory on semi-equivalence r e l a t i o n s is an important and useful tool for i n v e s t i g a t i n g c l a s s i f i c a t i o n , pattern r e c o g n i t i o n , p o l...
POPL
2000
ACM
13 years 10 months ago
2000
ACM
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...