3341 search results - page 196 / 669 » On Bounded Queries and Approximation |
142
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
158
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
138
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
153
click to vote
UAI
1998
15 years 6 months ago
1998
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...
127
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents an efficient method for approximation of temporal video data using linear Bezier fitting. For a given sequence of frames, the proposed method estimates the int...