1105 search results - page 86 / 221 » Linear choosability of graphs |
214
click to vote
PAKDD
2011
ACM
14 years 7 months ago
2011
ACM
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...
173
click to vote
PPDP
1999
Springer
15 years 8 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
146
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract--This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A...
134
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
157
click to vote
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...