6110 search results - page 19 / 1222 » Approximate Computing |
FAW
2010
Springer
13 years 9 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
TIT
2008
13 years 9 months ago
2008
In this paper, approximation by linear combinations of an increasing number n of computational units with adjustable parameters (such as perceptrons and radial basis functions) is ...
MFCS
2004
Springer
14 years 3 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
APPROX
2004
Springer
14 years 3 months ago
2004
Springer
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...