Sciweavers

20 search results - page 3 / 4
» Structured matrix methods for polynomial root-finding
Sort
View
CISST
2003
83views Hardware» more  CISST 2003»
13 years 8 months ago
Computational Efficiency of Structural Image Matching
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
Richard Chase, Boris Kovalerchuk
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 7 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer
ASPDAC
2007
ACM
146views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Practical Implementation of Stochastic Parameterized Model Order Reduction via Hermite Polynomial Chaos
Abstract-- This paper describes the stochastic model order reduction algorithm via stochastic Hermite Polynomials from the practical implementation perspective. Comparing with exis...
Yi Zou, Yici Cai, Qiang Zhou, Xianlong Hong, Sheld...
TSP
2008
134views more  TSP 2008»
13 years 7 months ago
MIMO Instantaneous Blind Identification Based on Second-Order Temporal Structure
Blind identification is of paramount importance for well-known signal processing problems such as Blind Signal Separation and Direction Of Arrival (DOA) estimation. This paper pre...
Jakob van de Laar, Marc Moonen, Piet C. W. Sommen
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
12 years 10 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski