Sciweavers

12194 search results - page 198 / 2439
» Numberings Optimal for Learning
Sort
View
ICML
2007
IEEE
16 years 7 months ago
A novel orthogonal NMF-based belief compression for POMDPs
High dimensionality of POMDP's belief state space is one major cause that makes the underlying optimal policy computation intractable. Belief compression refers to the method...
Xin Li, William Kwok-Wai Cheung, Jiming Liu, Zhili...
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
16 years 6 months ago
Ordering patterns by combining opinions from multiple sources
Pattern ordering is an important task in data mining because the number of patterns extracted by standard data mining algorithms often exceeds our capacity to manually analyze the...
Pang-Ning Tan, Rong Jin
ICML
2006
IEEE
16 years 13 days ago
Multiclass reduced-set support vector machines
There are well-established methods for reducing the number of support vectors in a trained binary support vector machine, often with minimal impact on accuracy. We show how reduce...
Benyang Tang, Dominic Mazzoni
CVPR
2005
IEEE
16 years 3 days ago
Robust Face Detection with Multi-Class Boosting
With the aim to design a general learning framework for detecting faces of various poses or under different lighting conditions, we are motivated to formulate the task as a classi...
Yen-Yu Lin, Tyng-Luh Liu
COMBINATORICA
2010
15 years 1 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...