We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael...
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
Abstract. This contribution introduces the so-called Workplace Learning Context as essential conceptualisation supporting self-directed learning experiences directly at the workpla...
Armin Ulbrich, Peter Scheir, Stefanie N. Lindstaed...
The difficulty inherent in schema matching has led to the development of several generic match algorithms. This paper describes how we adapted general approaches to the specific t...