4843 search results - page 260 / 969 » The Shortcut Problem - Complexity and Approximation |
137
Voted
WSCG
2003
15 years 5 months ago
2003
The problem of styling surfaces modeling is tackled. An approach based on section curves fairing is chosen. The concept of template curves is developed for approximating profiles ...
150
Voted
ECCC
2006
15 years 3 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
134
Voted
PR
1998
15 years 3 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
136
Voted
IPMU
2010
Springer
15 years 2 months ago
2010
Springer
It is well known that among all probabilistic graphical Markov models the class of decomposable models is the most advantageous in the sense that the respective distributions can b...
157
Voted
ISCI
2010
15 years 2 months ago
2010
A random set can be regarded as the result of the imprecise observation of a random variable. Following this interpretation, we study to which extent the upper and lower probabili...