Sciweavers

400 search results - page 42 / 80
» An Algorithm for the Reduction of Linear DAE
Sort
View
MST
2011
231views Hardware» more  MST 2011»
12 years 11 months ago
On the Complexity of Matroid Isomorphism Problem
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
ICONIP
2007
13 years 10 months ago
Principal Component Analysis for Sparse High-Dimensional Data
Abstract. Principal component analysis (PCA) is a widely used technique for data analysis and dimensionality reduction. Eigenvalue decomposition is the standard algorithm for solvi...
Tapani Raiko, Alexander Ilin, Juha Karhunen
GLOBECOM
2007
IEEE
14 years 3 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
AAAI
2010
13 years 10 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
ISLPED
2003
ACM
142views Hardware» more  ISLPED 2003»
14 years 2 months ago
Minimization of dynamic and static power through joint assignment of threshold voltages and sizing optimization
We describe an optimization strategy for minimizing total power consumption using dual threshold voltage (Vth) technology. Significant power savings are possible by simultaneous a...
David Nguyen, Abhijit Davare, Michael Orshansky, D...