6110 search results - page 73 / 1222 » Approximate Computing |
116
click to vote
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
136
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
115
Voted
COMPUTING
2004
15 years 2 months ago
2004
In [1] Optimal Control methods over re-parametrization for curve and surface design were introduced. The advantage of Optimal Control over Global Minimization such as in [17] is t...
214
Voted
NA
2011
14 years 9 months ago
2011
We are interested in computing the Fermi-Dirac matrix function in which the matrix argument is the Hamiltonian matrix arising from Density Function Theory (DFT) applications. More...
144
click to vote
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...