5269 search results - page 163 / 1054 » order 2007 |
132
click to vote
JCT
2007
15 years 4 months ago
2007
An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...
151
click to vote
JCT
2007
15 years 4 months ago
2007
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue (G) of its adjacency matrix. In particular, writing ks (G) for the number of s...
JMLR
2007
15 years 4 months ago
2007
In a recently published paper in JMLR, Tsang et al. (2005) present an algorithm for SVM called Core Vector Machines (CVM) and illustrate its performances through comparisons with ...
133
click to vote
ACS
2004
15 years 4 months ago
2004
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The descr...
116
click to vote
JSC
2007
15 years 4 months ago
2007
Abstract. We extend our recent work on set-theoretic solutions of the YangBaxter or braid relations with new results about their automorphism groups, strong twisted unions of solut...