Sciweavers

18 search results - page 3 / 4
» mcs 2005
Sort
View
COCOON
2005
Springer
13 years 7 months ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...
MCS
2005
Springer
13 years 10 months ago
Exploiting Class Hierarchies for Knowledge Transfer in Hyperspectral Data
Abstract. Obtaining ground truth for hyperspectral data is an expensive task. In addition, a number of factors cause the spectral signatures of the same class to vary with location...
Suju Rajan, Joydeep Ghosh
MCS
2005
Springer
13 years 10 months ago
Mixture of Gaussian Processes for Combining Multiple Modalities
This paper describes a unified approach, based on Gaussian Processes, for achieving sensor fusion under the problematic conditions of missing channels and noisy labels. Under the ...
Ashish Kapoor, Hyungil Ahn, Rosalind W. Picard
MCS
2005
Springer
13 years 10 months ago
Half-Against-Half Multi-class Support Vector Machines
A Half-Against-Half (HAH) multi-class SVM is proposed in this paper. Unlike the commonly used One-Against-All (OVA) and One-Against-One (OVO) implementation methods, HAH is built ...
Hansheng Lei, Venu Govindaraju
JGAA
2007
135views more  JGAA 2007»
13 years 5 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento