777 search results - page 78 / 156 » A fast algorithm for the computation of an upper bound on th... |
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...