577 search results - page 20 / 116 » Computing Rational Bisectors |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we determine some limit distributions of pattern statistics in rational stochastic models, defined by means of nondeterministic weighted finite automata. ...
GG
2004
Springer
14 years 1 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
IEEECGIV
2008
IEEE
14 years 2 months ago
2008
IEEE
In image processing, the curve comparisons can be achieved by extracting the curve information from the bitmapped images. The revealed curves are represented in the forms of the s...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...
AAAI
2010
13 years 8 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...