692 search results - page 37 / 139 » BDD minimization for approximate computing |
143
Voted
CPM
2000
Springer
15 years 8 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
125
click to vote
ICDE
2005
IEEE
15 years 9 months ago
2005
IEEE
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
154
Voted
ICML
2004
IEEE
16 years 4 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...
135
Voted
SC
1995
ACM
15 years 7 months ago
1995
ACM
Matrix-vector products (mat-vecs) form the core of iterative methods used for solving dense linear systems. Often, these systems arise in the solution of integral equations used i...
118
Voted
TIP
1998
15 years 3 months ago
1998
—The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desir...