3341 search results - page 46 / 669 » On Bounded Queries and Approximation |
164
Voted
SODA
2008
ACM
15 years 7 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
153
click to vote
ICIP
1999
IEEE
16 years 7 months ago
1999
IEEE
This paper presents an iterative algorithm for approximating gray-scale images with adaptive triangular meshes ensuring a given tolerance. At each iteration, the algorithm applies...
166
click to vote
ISAAC
2009
Springer
16 years 5 days ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
118
Voted
ICASSP
2008
IEEE
16 years 2 days ago
2008
IEEE
We attempt to quantify the possible gains that can be achieved by examining a rate-distortion competition between a conventional and a compressive sampling solution to data rate r...
169
click to vote
JMLR
2010
2010
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
15 years 12 days ago
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...