4894 search results - page 222 / 979 » The Guarding Problem - Complexity and Approximation |
193
click to vote
ML
2012
ACM
14 years 2 months ago
2012
ACM
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
177
click to vote
APPML
2008
15 years 6 months ago
2008
The main goal of this article is to discuss a controllability approach to the image matching / shape identification problem, an important issue in many applications, medical ones ...
189
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
166
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
184
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...