9736 search results - page 17 / 1948 » How Fast Can We Compute Products |
152
click to vote
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
Linear Discriminant Analysis (LDA) is a widely used technique for pattern classification. It seeks the linear projection of the data to a low dimensional subspace where the data ...
124
click to vote
JSC
2006
15 years 4 months ago
2006
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
127
click to vote
ISCA
1989
IEEE
15 years 8 months ago
1989
IEEE
: We explore the question: “What can a von Neumann processor borrow from dataflow to make it more suitable for a multiprocessor?’’ Starting with a simple, “RISC-like” ins...
131
click to vote
DPPI
2007
ACM
15 years 8 months ago
2007
ACM
Abstract. Shareability is a design principle that refers to how a system, interface, or device engages a group of collocated, co-present users in shared interactions around the sam...
139
click to vote
AAAI
2011
14 years 4 months ago
2011
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...