EJC
2016
8 years 8 months ago
2016
It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. We prove the conjecture ...
EJC
2016
8 years 8 months ago
2016
We study the circulant complex Hadamard matrices of order n whose entries are l-th roots of unity. For n = l prime we prove that the only such matrix, up to equivalence, is the Fou...
EJC
2016
8 years 8 months ago
2016
Szemer´edi’s regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov´asz and Szegedy [7] gave a Hilb...
EJC
2016
8 years 8 months ago
2016
The Morse-Hedlund Theorem states that a bi-infinite sequence η in a finite alphabet is periodic if and only if there exists n ∈ N such that the block complexity function Pη(n...
EJC
2016
8 years 8 months ago
2016
First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neigh...
EJC
2016
8 years 8 months ago
2016
A function
ECIR
2016
Springer
8 years 8 months ago
2016
Springer
ECIR
2016
Springer
8 years 8 months ago
2016
Springer
We harvest training images for visual object recognition by casting it as an IR task. In contrast to previous work, we concentrate on fine-grained object categories, such as the l...
ECIR
2016
Springer
8 years 8 months ago
2016
Springer
Abstract We deal with a problem faced by scholars every day: identifying relevant papers on a given topic. In particular, we focus on the scenario where a scholar can come up with ...
ECIR
2016
Springer
8 years 8 months ago
2016
Springer
Abstract. In this paper, we explore a geo-spatial learning-to-rank framework for identifying local experts. Three of the key features of the proposed approach are: (i) a learning-b...