15485 search results - page 684 / 3097 » Computing Optimal Subsets |
189
click to vote
ASPDAC
2007
ACM
15 years 11 months ago
2007
ACM
Abstract: This paper presents an approach to area optimization of arithmetic datapaths that perform polynomial computations over bit-vectors with finite widths. Examples of such de...
185
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
189
click to vote
DAC
1995
ACM
15 years 11 months ago
1995
ACM
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
209
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
367
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...