Sciweavers

HCI
2011
13 years 1 months ago
Discovering Context: Classifying Tweets through a Semantic Transform Based on Wikipedia
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...
Yegin Genc, Yasuaki Sakamoto, Jeffrey V. Nickerson
EM
2010
154views Management» more  EM 2010»
13 years 4 months ago
Higher-Weight Heegner Points
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...
Kimberly Hopkins
JGT
2011
76views more  JGT 2011»
13 years 5 months ago
Intersections of graphs
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...
Béla Bollobás, Alex D. Scott
DCC
2011
IEEE
13 years 5 months ago
Primitive polynomials, singer cycles and word-oriented linear feedback shift registers
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plaus...
Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari
CPC
2011
219views Education» more  CPC 2011»
13 years 5 months ago
On Percolation and the Bunkbed Conjecture
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
Svante Linusson
ISAAC
2010
Springer
268views Algorithms» more  ISAAC 2010»
13 years 8 months ago
On the Intersection of Tolerance and Cocomparability Graphs
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...
George B. Mertzios, Shmuel Zaks
SIAMDM
2010
138views more  SIAMDM 2010»
13 years 8 months ago
The Last Fraction of a Fractional Conjecture
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...
Frantisek Kardos, Daniel Král', Jean-S&eacu...
RAID
2010
Springer
13 years 8 months ago
On Challenges in Evaluating Malware Clustering
Malware clustering and classification are important tools that enable analysts to prioritize their malware analysis efforts. The recent emergence of fully automated methods for ma...
Peng Li, Limin Liu, Debin Gao, Michael K. Reiter
JGT
2010
108views more  JGT 2010»
13 years 8 months ago
Hadwiger number and chromatic number for near regular degree sequences
: We consider a problem related to Hadwiger’s Conjecture. Let
Neil Robertson, Zi-Xia Song
GC
2010
Springer
13 years 8 months ago
20 Years of Negami's Planar Cover Conjecture
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
Petr Hlinený