نتایج جستجو برای: the painter
تعداد نتایج: 16052809 فیلتر نتایج به سال:
When graph Ramsey theory is viewed as a game, “Painter” 2-colors the edges of a graph presented by “Builder”. Builder wins if every coloring has a monochromatic copy of a fixed graph G. In the on-line version, iteratively, Builder presents one edge and Painter must color it. Builder must keep the presented graph in a class H. Builder wins the game (G,H) if a monochromatic copy of G can be force...
Correct interpretation of the text frequently requires knowledge of semantic categories of nouns, especially in languages with free word order. For example, in Spanish the phrases pintó un cuadro un pintor (lit. painted a picture a painter) and pintó un pintor un cuadro (lit. painted a painter a picture) mean the same: ‘a painter painted a picture’; with the only way to tell the subject from th...
The goal of this paper is to offer a framework for image classification “by type”. For example, one may want to classify an image of a certain office as man-made – as opposed to outdoor – scene, even if no image of a similar office exists in the training set. This is accomplished by using local features, and using the naive Bayes classifier. The application presented here is classification of p...
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 ...
Ascension (heavenly journey of Prophet Muhammad) is one of the most important religious issues that its representation was especially important in manuscripts of Islamic countries. In Timurid and Safavid periods, many painters worked in this field and famous people such as Kamal al-Din Behzad and Sultan Muhammad created fine works in the field. Due to the cultural relations with Safavid and Mug...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید