1369 search results - page 107 / 274 » Lattice computations for random numbers |
SPAA
1998
ACM
14 years 18 days ago
1998
ACM
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
COMBINATORICS
2007
13 years 9 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several b...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...