3341 search results - page 192 / 669 » On Bounded Queries and Approximation |
151
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
180
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
201
click to vote
UAI
2001
15 years 8 months ago
2001
We propose a new approach to value-directed belief state approximationfor POMDPs. The valuedirected model allows one to choose approximation methods for belief state monitoringtha...
204
click to vote
JGAA
2007
15 years 7 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
197
Voted
CGF
2005
15 years 7 months ago
2005
This paper describes a method to obtain a closed surface that approximates a general 3D data point set with non-uniform density. Aside from the positions of the initial data point...