66 search results - page 1 / 14 » Efficient Matrix Chain Ordering in Polylog Time |
IPPS
1994
IEEE
13 years 9 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
AR
2011
13 years 17 days ago
2011
We propose a real-time pose invariant face recognition algorithm from a gallery of frontal images only. First, we modified the second order minimization method for active appearan...
IWOCA
2010
Springer
13 years 10 days ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
EOR
2007
13 years 5 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
TCOM
2010
13 years 7 days ago
2010
Abstract--Motivated by the recent concept of Spatial Modulation (SM), we propose a novel Space-Time Shift Keying (STSK) modulation scheme for Multiple-Input Multiple-Output (MIMO) ...