Sciweavers

11 search results - page 1 / 3
» Speeding up SVM Decision Based on Mirror Points
Sort
View
ICPR
2002
IEEE
14 years 5 months ago
Speeding up SVM Decision Based on Mirror Points
In this paper, we propose a new method to speed up SVM decision based on the idea of mirror points. Decisions based on multiple simple classifiers, which are formed as a result of...
Jiun-Hung Chen, Chu-Song Chen
JMLR
2010
108views more  JMLR 2010»
12 years 11 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...
JAIR
2006
160views more  JAIR 2006»
13 years 4 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
IJIT
2004
13 years 6 months ago
Morphing Human Faces: Automatic Control Points Selection And Color Transition
In this paper, we propose a morphing method by which face color images can be freely transformed. The main focus of this work is the transformation of one face image to another. Th...
Stephen Karungaru, Minoru Fukumi, Norio Akamatsu
MM
2004
ACM
78views Multimedia» more  MM 2004»
13 years 10 months ago
Indexing and matching of polyphonic songs for query-by-singing system
This paper investigates the issues in polyphonic popular song retrieval. The problems that we consider include singing voice extraction, melodic curve representation, and database...
Tat-Wan Leung, Chong-Wah Ngo