We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
1) the density of building is low 2) image resolution is high 3) the color or gray scale for building's surface In this paper, an improved approach of are 'lose to unifo...
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
We address the problem of fast, large scale sketch-based image retrieval, searching in a database of over one million images. We show that current retrieval methods do not scale w...
Mathias Eitz, Kristian Hildebrand, Tamy Boubekeur,...
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...