Sciweavers

688 search results - page 51 / 138
» Computing with subspaces
Sort
View
DAC
1996
ACM
15 years 1 months ago
A Methodology for Concurrent Fabrication Process/Cell Library Optimization
- This paper presents a methodology for concurrently optimizing an IC fabrication process and a standard cell library in order to maximize overall yield. The approach uses the Conc...
Arun N. Lokanathan, Jay B. Brockman, John E. Renau...
86
Voted
PARA
2004
Springer
15 years 3 months ago
Structure-Preserving Model Reduction
A general framework for structure-preserving model reduction by Krylov subspace projection methods is developed. The goal is to preserve any substructures of importance in the matr...
Ren-Cang Li, Zhaojun Bai
83
Voted
ICMCS
2008
IEEE
151views Multimedia» more  ICMCS 2008»
15 years 4 months ago
Fast keyword detection with sparse time-frequency models
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
Effrosini Kokiopoulou, Pascal Frossard, Olivier Ve...
95
Voted
ECCV
2008
Springer
14 years 10 months ago
Discriminative Locality Alignment
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
Tianhao Zhang, Dacheng Tao, Jie Yang
86
Voted
CVPR
2005
IEEE
15 years 11 months ago
Appearance Modeling for Tracking in Multiple Non-Overlapping Cameras
When viewed from a system of multiple cameras with nonoverlapping fields of view, the appearance of an object in one camera view is usually very different from its appearance in a...
Omar Javed, Khurram Shafique, Mubarak Shah