1369 search results - page 28 / 274 » Lattice computations for random numbers |
AAECC
2005
Springer
13 years 8 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
CLA
2007
13 years 10 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
WIMOB
2007
IEEE
14 years 3 months ago
2007
IEEE
As part of the IEEE 802.16 protocol, the random access scheme is used for ranging. The ratio between the numbers of periodic ranging slots and data slots in the uplink subframe de...
ENDM
2000
13 years 8 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...