4894 search results - page 465 / 979 » The Guarding Problem - Complexity and Approximation |
151
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
149
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known discrete memoryless channel (DMC) ar...
157
click to vote
FUIN
2006
15 years 6 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
163
click to vote
IJON
2008
15 years 6 months ago
2008
Real-world data sets such as recordings from functional magnetic resonance imaging often possess both spatial and temporal structure. Here, we propose an algorithm including such ...
138
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
Abstract. The paper addresses the problem of discrimination of homographs when a lengthy segment of an uttered word is missing. The considered discrimination procedure is done by r...