2356 search results - page 84 / 472 » Characterizations of postman sets |
130
click to vote
COGSCI
2010
15 years 4 months ago
2010
Computational models of meaning trained on naturally occurring text successfully model human performance on tasks involving simple similarity measures, but they characterize meani...
115
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
133
click to vote
GC
2006
Springer
15 years 4 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
142
click to vote
CORR
2009
Springer
15 years 2 months ago
2009
Springer
on of abstract strategies which is extensional in the sense that a strategy is defined explicitly of derivations of an abstract reduction system. We then move to a more intensional...
137
click to vote
MLQ
2010
15 years 2 months ago
2010
: It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF (Zermelo-Fraenkel set theory without the Axiom of Choice), we c...