66 search results - page 3 / 14 » Efficient Matrix Chain Ordering in Polylog Time |
TPDS
1998
13 years 6 months ago
1998
—A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to...
DFT
2004
IEEE
13 years 10 months ago
2004
IEEE
This paper addresses the problem of test response compaction. In order to maximize compaction ratio, a single-output encoder based on check matrix of a (n, n1, m, 3) convolutional...
STOC
2009
ACM
14 years 7 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
IIWAS
2008
13 years 8 months ago
2008
Supply chains have evolved to web-applications that tap on the power of internet to expand their networks online. Recently some research attention is focused on make-to-order supp...
ISMB
1994
13 years 8 months ago
1994
Wepresent algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subj...