Sciweavers

401 search results - page 40 / 81
» Group-theoretic Algorithms for Matrix Multiplication
Sort
View
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
15 years 6 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips
MOC
1998
107views more  MOC 1998»
14 years 11 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche
ISCAS
2007
IEEE
95views Hardware» more  ISCAS 2007»
15 years 6 months ago
A Universal Approach to Developing Fast Algorithm for Simplified Order-16 ICT
—Simplified order-16 Integer Cosine Transform (ICT) has been proved to be an efficient coding tool especially for High-Definition (HD) video coding and is much simpler than ICT a...
Jie Dong, King Ngi Ngan, Chi-Keung Fong, Wai-kuen ...
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
15 years 6 months ago
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
Sung Eun Bae, Tadao Takaoka
ECCC
2006
112views more  ECCC 2006»
14 years 11 months ago
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas