Sciweavers

5100 search results - page 170 / 1020
» The Linear Complexity of a Graph
Sort
View
ICIP
2003
IEEE
15 years 7 days ago
Boosting linear discriminant analysis for face recognition
In this paper, we propose a new algorithm to boost performance of traditional Linear Discriminant Analysis (LDA)-based face recognition (FR) methods in complex FR tasks, where hig...
Juwei Lu, Konstantinos N. Plataniotis, Anastasios ...
VTC
2006
IEEE
14 years 4 months ago
Soft Detection with Linear Precoding for Spatial Multiplexing Systems
— We present a precoded reduced-complexity soft detection (PRCSD) algorithm for spatial multiplexing systems. The linear operations at both transmit and receive sides based on co...
Yong Li, Jaekyun Moon
BIRTHDAY
2003
Springer
14 years 3 months ago
On the Computational Complexity of Hierarchical Radiosity
The hierarchical radiosity algorithm is an efficient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization ...
Robert Garmann, Heinrich Müller
AUTOMATICA
1999
62views more  AUTOMATICA 1999»
13 years 10 months ago
Complexity of stability and controllability of elementary hybrid systems
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...
Vincent D. Blondel, John N. Tsitsiklis
BMCBI
2008
115views more  BMCBI 2008»
13 years 10 months ago
BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
George Chin Jr., Daniel G. Chavarría-Mirand...