4894 search results - page 350 / 979 » The Guarding Problem - Complexity and Approximation |
174
click to vote
NA
2007
15 years 6 months ago
2007
Runge-Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these met...
119
click to vote
CVPR
1998
IEEE
16 years 8 months ago
1998
IEEE
Previous research has shown that aggregated predictors improve the performance of non-parametric function approximation techniques. This paper presents the results of applying agg...
153
click to vote
AAIM
2007
Springer
16 years 28 days ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
171
click to vote
SIGECOM
2003
ACM
15 years 12 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
199
click to vote
ICDAR
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...