Sciweavers

369 search results - page 11 / 74
» Fast Algorithms for the Generalized Foley-Sammon Discriminan...
Sort
View
STACS
2004
Springer
14 years 25 days ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
PRL
2006
180views more  PRL 2006»
13 years 7 months ago
MutualBoost learning for selecting Gabor features for face recognition
This paper describes an improved boosting algorithm, the MutualBoost algorithm, and its application in developing a fast and robust Gabor feature based face recognition system. Th...
LinLin Shen, Li Bai
ICML
2009
IEEE
14 years 8 months ago
A least squares formulation for a class of generalized eigenvalue problems in machine learning
Many machine learning algorithms can be formulated as a generalized eigenvalue problem. One major limitation of such formulation is that the generalized eigenvalue problem is comp...
Liang Sun, Shuiwang Ji, Jieping Ye
AAAI
2010
13 years 9 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
IJCV
2006
125views more  IJCV 2006»
13 years 7 months ago
Robust Tracking Using Foreground-Background Texture Discrimination
This paper conceives of tracking as the developing distinction of a foreground against the background. In this manner, fast changes in the object or background appearance can be de...
Hieu Tat Nguyen, Arnold W. M. Smeulders