6110 search results - page 151 / 1222 » Approximate Computing |
178
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
156
click to vote
ADCM
2007
15 years 6 months ago
2007
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical diļ¬erentiation. Under an a priori and an a posteriori choice r...
190
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
172
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
156
click to vote
GRAPHICSINTERFACE
1998
15 years 7 months ago
1998
Fractal functions are explored as a representation for rough data in computer graphics. Two new techniques for using fractal interpolation functions to approximate rough functions...