Sciweavers

644 search results - page 24 / 129
» Decomposition Complexity
Sort
View
118
Voted
ICIP
2000
IEEE
16 years 2 months ago
Rotationally Invariant Texture Features Using the Dual-Tree Complex Wavelet Transform
New rotationally invariant texture feature extraction methods are introduced that utilise the dual tree complex wavelet transform (DT-CWT). The complex wavelet transform is a new ...
Paul R. Hill, David R. Bull, Cedric Nishan Canagar...
99
Voted
PIMRC
2008
IEEE
15 years 7 months ago
Limited feedback for multi-antenna multi-user communications with Generalized Multi-Unitary Decomposition
– In this paper, we propose a decomposition method called Generalized Multi-Unitary Decomposition (GMUD) which is useful in multi-user MIMO precoding. This decomposition transfor...
Wee Seng Chua, Chau Yuen, Yong Liang Guan, Francoi...
93
Voted
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
16 years 28 days ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj
112
Voted
CC
2007
Springer
208views System Software» more  CC 2007»
15 years 6 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
98
Voted
ISIM
2007
15 years 2 months ago
Using Matrix Decompositions in Formal Concept Analysis
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
Václav Snásel, Petr Gajdos, Hussam M...