We consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line ...

This paper presents a simple yet efficient image retrieval approach by proposing a new image feature detector and descriptor, namely the micro-structure descriptor (MSD). The micro-structures are defined based on an edge orientation similarity, and the MSD is built based on the underlying colors in microstructures with similar edge orientation. With micro-structures serving as a bridge, the MSD...

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 introduced two at the time, in a random order. For each pair of edges, Painter immediately and irrevocably chooses one of the two possibilities to color one of them red and the other one blue. His goal is to avoid crea...

The Dutch painter Rembrandt van Rijn (1606-1669) left behind the largest collection of self-portraits in the history of art. Although about 40 of his oil paintings could be considered "self-portraits," controversy still exists regarding 14 of them. We undertook to determine the identity of the painter or the subject. Our work was based on the generally accepted premise that these portraits repr...

For any graph F and any integer r ≥ 2, the online vertex-Ramsey density of F and r, denoted m∗(F, r), is a parameter defined via a deterministic two-player Ramsey-type game (Painter vs. Builder). This parameter was introduced in a recent paper [arXiv:1103.5849 ], where it was shown that the online vertex-Ramsey density determines the threshold of a similar probabilistic one-player game (Painter...