2016 search results - page 153 / 404 » Megamaps: Construction and Examples |
163
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
169
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
In this paper we demonstrate a new and original way to apply the representation theory of finite groups to the development of space-time codes for use in multiple antenna wireless ...
131
click to vote
IMA
2005
Springer
16 years 20 hour ago
2005
Springer
In this paper we discuss the idea of block cipher embeddings and consider a natural algebraic framework for such constructions. In this approach we regard block cipher state spaces...
177
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length n + c n log n . We disprove a conjecture of Erd˝o...
157
click to vote
ICFCA
2004
Springer
15 years 12 months ago
2004
Springer
Based on the conceptual representation of objects in space and time as introduced in Temporal Concept Analysis first steps are done into the direction of a conceptual theory of ...