Sciweavers

1523 search results - page 58 / 305
» The Computational Complexity of Linear Optics
Sort
View
CVPR
2007
IEEE
14 years 11 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
CVPR
2008
IEEE
14 years 11 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs
DNA
2009
Springer
173views Bioinformatics» more  DNA 2009»
14 years 3 months ago
Time-Complexity of Multilayered DNA Strand Displacement Circuits
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
Georg Seelig, David Soloveichik
IPPS
2009
IEEE
14 years 3 months ago
Fast development of dense linear algebra codes on graphics processors
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...
M. Jesús Zafont, Alberto F. Martín, ...
STACS
2007
Springer
14 years 2 months ago
On the Complexity of Unary Tiling-Recognizable Picture Languages
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
Alberto Bertoni, Massimiliano Goldwurm, Violetta L...