Sciweavers

249 search results - page 33 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
BMCBI
2006
96views more  BMCBI 2006»
13 years 9 months ago
Structure alignment based on coding of local geometric measures
Background: A structure alignment method based on a local geometric property is presented and its performance is tested in pairwise and multiple structure alignments. In this appr...
Peter L. Chang, Andrew W. Rinne, T. Gregory Dewey
CVPR
2008
IEEE
14 years 3 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
14 years 3 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
ISCAS
2007
IEEE
95views Hardware» more  ISCAS 2007»
14 years 3 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 ...
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
14 years 17 days ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider