397 search results - page 51 / 80 » Pseudorandom Functions and Lattices |
137
click to vote
COMPSAC
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
145
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
118
click to vote
JOC
2002
15 years 28 days ago
2002
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
ICRA
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract— Miniaturization of Programmable Matter is a major challenge. Much of the difficulty stems from size and power requirements of internal actuators. This paper demonstrat...
123
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we extend our previous study on discriminative training using non-uniform criteria for speech recognition. The work will put emphasis on how the acoustic modeling i...