Sciweavers

286 search results - page 20 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
95
Voted
COMSIS
2010
14 years 7 months ago
A novel hierarchical speech emotion recognition method based on improved DDAGSVM
In order to improve the recognition accuracy of speech emotion recognition, in this paper, a novel hierarchical method based on improved Decision Directed Acyclic Graph SVM (improv...
Qi-Rong Mao, Yong-Zhao Zhan
CIARP
2009
Springer
14 years 7 months ago
A Computer-Assisted Colorization Approach Based on Efficient Belief Propagation and Graph Matching
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
Alexandre Noma, Luiz Velho, Roberto M. Cesar
GBRPR
2009
Springer
15 years 4 months ago
On Computing Canonical Subsets of Graph-Based Behavioral Representations
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
Walter C. Mankowski, Peter Bogunovich, Ali Shokouf...
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
15 years 10 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
ICPR
2004
IEEE
15 years 10 months ago
Direct Condensing: An Efficient Voronoi Condensing Algorithm for Nearest Neighbor Classifiers
Voronoi condensing reduces training patterns of nearest neighbor classifiers without changing the classification boundaries. This method plays important roles not only in the near...
Takekazu Kato, Toshikazu Wada