Sciweavers

14379 search results - page 2866 / 2876
» is 2000
Sort
View
MST
2007
167views more  MST 2007»
14 years 10 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
NECO
2007
127views more  NECO 2007»
14 years 10 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
TVLSI
2008
150views more  TVLSI 2008»
14 years 9 months ago
Data Memory Subsystem Resilient to Process Variations
As technology scales, more sophisticated fabrication processes cause variations in many different parameters in the device. These variations could severely affect the performance o...
M. Bennaser, Yao Guo, Csaba Andras Moritz
IEEECIT
2010
IEEE
14 years 9 months ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...
INFORMATICALT
2010
122views more  INFORMATICALT 2010»
14 years 8 months ago
On a Time-Varying Parameter Adaptive Self-Organizing System in the Presence of Large Outliers in Observations
In the previous papers (Pupeikis, 2000; Genov et al., 2006; Atanasov and Pupeikis, 2009), a direct approach for estimating the parameters of a discrete-time linear time-invariant (...
Rimantas Pupeikis
« Prev « First page 2866 / 2876 Last » Next »