1369 search results - page 134 / 274 » Lattice computations for random numbers |
POLICY
2007
Springer
14 years 3 months ago
2007
Springer
The implementation of network security devices such as firewalls and IDSs are constantly being improved to accommodate higher security and performance standards. Using reliable a...
IPL
2006
13 years 9 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
CISS
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
SIGMETRICS
2008
ACM
13 years 9 months ago
2008
ACM
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...