481 search results - page 27 / 97 » Martin's game: a lower bound for the number of sets |
TMC
2011
13 years 3 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
JCO
2008
13 years 8 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
CG
2004
Springer
14 years 10 days ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
FOCS
1999
IEEE
14 years 27 days ago
1999
IEEE
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
SIAMDM
2010
13 years 3 months ago
2010
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by...