3105 search results - page 468 / 621 » The Path-Packing Structure of Graphs |
126
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
150
click to vote
BVAI
2005
Springer
15 years 9 months ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
127
click to vote
SIGECOM
2004
ACM
15 years 9 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
130
click to vote
APN
2004
Springer
15 years 9 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
124
click to vote
ESWS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We think of Match as an operator which takes two graph-like structures and produces a mapping between those nodes of the two graphs that correspond semantically to each o...