4894 search results - page 268 / 979 » The Guarding Problem - Complexity and Approximation |
169
click to vote
ACL
2006
15 years 8 months ago
2006
We consider the problem of producing a multi-document summary given a collection of documents. Since most successful methods of multi-document summarization are still largely extr...
179
click to vote
WSCG
2003
15 years 8 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 ...
186
click to vote
ECCC
2006
15 years 6 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 ...
170
click to vote
PR
1998
15 years 6 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...
171
click to vote
IPMU
2010
Springer
15 years 5 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...