Sciweavers

412 search results - page 52 / 83
» Diagonalization
Sort
View
ECCC
2006
145views more  ECCC 2006»
14 years 9 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
TASLP
2011
14 years 4 months ago
Time-Frequency Cepstral Features and Heteroscedastic Linear Discriminant Analysis for Language Recognition
Abstract—The shifted delta cepstrum (SDC) is a widely used feature extraction for language recognition (LRE). With a high context width due to incorporation of multiple frames, S...
Weiqiang Zhang, Liang He, Yan Deng, Jia Liu, M. T....
CVPR
1997
IEEE
15 years 11 months ago
Efficient Approximation of Range Images Through Data-Dependent Adaptive Triangulations
This paper presents an efficient algorithm for generating adaptive triangular meshes from dense range images. The proposed technique consists of two stages. First, a quadrilateral...
Miguel Angel García, Angel Domingo Sappa, L...
CVPR
2005
IEEE
15 years 11 months ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
David Tolliver, Gary L. Miller, Robert T. Collins
CVPR
2005
IEEE
15 years 11 months ago
Coupled Kernel-Based Subspace Learning
It was prescriptive that an image matrix was transformed into a vector before the kernel-based subspace learning. In this paper, we take the Kernel Discriminant Analysis (KDA) alg...
Shuicheng Yan, Dong Xu, Lei Zhang, Benyu Zhang, Ho...