5387 search results - page 105 / 1078 » Generating generic functions |
89
Voted
ECCC
2002
15 years 17 days ago
2002
Abstract. We consider the function ensembles emerging from the construction of Goldreich, Goldwasser and Micali (GGM), when applied to an arbitrary pseudoramdon generator. We show ...
105
Voted
AFRICACRYPT
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
88
Voted
COMBINATORICS
2004
15 years 18 days ago
2004
In this paper, we examine partitions classified according to the number r() of odd parts in and s() the number of odd parts in , the conjugate of . The generating function for ...
90
Voted
SSDBM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract. With the drastic increase of object trajectory data, the analysis and exploration of trajectories has become a major research focus with many applications. In particular,...
106
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...