344 search results - page 63 / 69 » Banach-Mazur Games on Graphs |
170
click to vote
NIPS
2001
15 years 7 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
147
click to vote
ACMACE
2008
ACM
15 years 8 months ago
2008
ACM
This paper proposes a new method to generate smooth camera movement that is collision-free in a three-dimensional virtual environment. It generates a set of cells based on cell de...
173
click to vote
TCS
2008
15 years 5 months ago
2008
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
173
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
177
click to vote
CSL
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...