Sciweavers

1389 search results - page 124 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ICANN
2007
Springer
15 years 11 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
CVPR
2009
IEEE
17 years 2 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
CVPR
2004
IEEE
16 years 9 months ago
Improving Object Classification in Far-Field Video
Object classification in far-field video sequences is a challenging problem because of low resolution imagery and projective image distortion. Most existing far-field classificati...
Biswajit Bose, W. Eric L. Grimson
ICDM
2006
IEEE
225views Data Mining» more  ICDM 2006»
16 years 1 months ago
Adaptive Kernel Principal Component Analysis with Unsupervised Learning of Kernels
Choosing an appropriate kernel is one of the key problems in kernel-based methods. Most existing kernel selection methods require that the class labels of the training examples ar...
Daoqiang Zhang, Zhi-Hua Zhou, Songcan Chen
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
16 years 4 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White