4913 search results - page 250 / 983 » Results and Perspectives of the G |
162
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
183
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
179
click to vote
JAPLL
2010
15 years 5 months ago
2010
Two currently active strands of research on logics for multi-agent systems are dynamic epistemic logic, focusing on the epistemic consequences of actions, and logics of coalitiona...
165
click to vote
TCS
2010
15 years 5 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
239
click to vote
TCSV
2011
15 years 1 months ago
2011
This paper proposes a background subtraction method for Bayer-pattern image sequences. The proposed method models the background in a Bayer-pattern domain using a mixture of Gauss...