885 search results - page 141 / 177 » Random Matrices in Data Analysis |
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Bloom filter is a space-efficient randomized data structure for group membership query. It is widely used in networking applications which involve the packet header/content i...
AUIC
2006
IEEE
14 years 1 months ago
2006
IEEE
The Future Operations Centre Analysis Laboratory (FOCAL) at Australia’s Defence Science and Technology Organisation (DSTO) is aimed at exploring new paradigms for situation awar...
ACNS
2010
Springer
13 years 11 months ago
2010
Springer
Secure sketches are useful in extending cryptographic schemes to biometric data since they allow recovery of fuzzy secrets under inevitable noise. In practice, secrets derived from...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...