9736 search results - page 83 / 1948 » How Fast Can We Compute Products |
126
click to vote
BIODATAMINING
2008
15 years 4 months ago
2008
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
132
click to vote
SACRYPT
2001
Springer
15 years 9 months ago
2001
Springer
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
135
click to vote
EUROCRYPT
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealin...
160
click to vote
PARELEC
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an organic computing approach for very fast image processing, which we call Marching Pixels (MPs). Using an embedded massively-parallel array of processor elements (PEs...
181
click to vote
ICAPR
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...