Sciweavers

684 search results - page 91 / 137
» On embedding well-separable graphs
Sort
View
MCS
2010
Springer
15 years 6 months ago
Selecting Structural Base Classifiers for Graph-Based Multiple Classifier Systems
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
Wan-Jui Lee, Robert P. W. Duin, Horst Bunke
DM
2002
186views more  DM 2002»
15 years 3 months ago
Coloring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
Bojan Mohar
CVPR
2008
IEEE
16 years 6 months ago
Recognizing human actions using multiple features
In this paper, we propose a framework that fuses multiple features for improved action recognition in videos. The fusion of multiple features is important for recognizing actions ...
Jingen Liu, Saad Ali, Mubarak Shah
147
Voted
COMPGEOM
2010
ACM
15 years 9 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
IJON
2010
121views more  IJON 2010»
15 years 1 months ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen