Sciweavers

5 search results - page 1 / 1
» Linear Higher-Order Matching Is NP-Complete
Sort
View
RTA
2000
Springer
13 years 8 months ago
Linear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
Philippe de Groote
ICA
2004
Springer
13 years 10 months ago
Temporal Decorrelation as Preprocessing for Linear and Post-nonlinear ICA
Abstract. We present a straightforward way to use temporal decorrelation as preprocessing in linear and post-nonlinear independent component analysis (ICA) with higher order statis...
Juha Karvanen, Toshihisa Tanaka
ICCAD
2002
IEEE
175views Hardware» more  ICCAD 2002»
14 years 1 months ago
Efficient model order reduction via multi-node moment matching
- The new concept of Multi-node Moment Matching (MMM) is introduced in this paper. The MMM technique simultaneously matches the moments at several nodes of a circuit using explicit...
Yehea I. Ismail
TWC
2008
148views more  TWC 2008»
13 years 4 months ago
ARMA Synthesis of Fading Channels
Computationally scalable and accurate estimation, prediction, and simulation of wireless communication channels is critical to the development of more adaptive transceiver algorith...
Hani Mehrpouyan, Steven D. Blostein
CVPR
2004
IEEE
14 years 6 months ago
Linear Model Hashing and Batch RANSAC for Rapid and Accurate Object Recognition
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...
Ying Shan, Bogdan Matei, Harpreet S. Sawhney, Rake...