Sciweavers

73 search results - page 7 / 15
» Projective-planar signed graphs and tangled signed graphs
Sort
View
PAKDD
2011
ACM
253views Data Mining» more  PAKDD 2011»
12 years 10 months ago
Balance Support Vector Machines Locally Using the Structural Similarity Kernel
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
Jianxin Wu
EJC
2007
13 years 7 months ago
The homology of the cycle matroid of a coned graph
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
Woong Kook
OHS
2000
Springer
13 years 11 months ago
Applying Computer Semiotics to Hypertext Theory and the World Wide Web
This paper introduces a Semiotic Appoach to Hypertext Theory. Having been applied to Informatics only in recent years, Semiotics promises a broader understanding of Hypertext as a ...
Moritz Neumüller
DM
2008
69views more  DM 2008»
13 years 7 months ago
The signed-graphic representations of wheels and whirls
We characterize all of the ways to represent the wheel matroids and whirl matroids using frame matroids of signed graphs. The characterization of wheels is in terms of topological...
Daniel C. Slilaty, Hongxun Qin
GBRPR
2007
Springer
14 years 1 months ago
Grouping Using Factor Graphs: An Approach for Finding Text with a Camera Phone
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
Huiying Shen, James Coughlan