Sciweavers

1859 search results - page 95 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
CVPR
2010
IEEE
16 years 19 days ago
On-line Semi-supervised Multiple-Instance Boosting
A recent dominating trend in tracking called tracking-by-detection uses on-line classifiers in order to redetect objects over succeeding frames. Although these methods usually deli...
Bernhard Zeisl, Christian Leistner, Amir Saffari, ...
ICPR
2006
IEEE
16 years 6 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
15 years 8 months ago
Spectral Regression: A Unified Approach for Sparse Subspace Learning
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
Deng Cai, Xiaofei He, Jiawei Han
ICCV
2007
IEEE
16 years 6 months ago
Limits of Learning-Based Superresolution Algorithms
Learning-based superresolution (SR) are popular SR techniques that use application dependent priors to infer the missing details in low resolution images (LRIs). However, their pe...
Zhouchen Lin, Junfeng He, Xiaoou Tang, Chi-Keung T...
COLT
1994
Springer
15 years 9 months ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...