HCI

2011

13 years 1 months ago
2011

By mapping messages into a large context, we can compute the distances between them, and then classify them. We test this conjecture on Twitter messages: Messages are mapped onto t...

EM

2010

13 years 4 months ago
2010

In this paper we formulate a conjecture which partially generalizes the Gross-Kohnen-Zagier theorem to higher weight modular forms. For f S2k(N) satisfying certain conditions, we c...

JGT

2011

13 years 5 months ago
2011

Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide som...

DCC

2011

IEEE

13 years 5 months ago
2011

IEEE

Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the aﬃrmative in a special case, and outline a plaus...

CPC

2011

13 years 5 months ago
2011

We study a problem on edge percolation on product graphs G× K2. Here G is any ﬁnite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...

ISAAC

2010

Springer

13 years 8 months ago
2010

Springer

It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability g...

SIAMDM

2010

13 years 8 months ago
2010

Reed conjectured that for every ε > 0 and every integer ∆, there exists g such that the fractional total chromatic number of every graph with maximum degree ∆ and girth at...

RAID

2010

Springer

13 years 8 months ago
2010

Springer

Malware clustering and classiﬁcation are important tools that enable analysts to prioritize their malware analysis efforts. The recent emergence of fully automated methods for ma...

JGT

2010

13 years 8 months ago
2010

: We consider a problem related to Hadwiger’s Conjecture. Let

GC

2010

Springer

13 years 8 months ago
2010

Springer

In 1988, Seiya Negami published a conjecture stating that a graph G has a ﬁnite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...