4894 search results - page 258 / 979 » The Guarding Problem - Complexity and Approximation |
182
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
168
click to vote
CIARP
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
168
click to vote
SSPR
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. For many statistical pattern recognition methods, distributions of sample vectors are assumed to be normal, and the quadratic discriminant function derived from the proba...
146
click to vote
AAAI
2008
15 years 9 months ago
2008
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
226
click to vote
GEOINFO
2007
15 years 8 months ago
2007
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string mat...