2570 search results - page 158 / 514 » Fast Algorithms For The Computation Of Ranklets |
125
Voted
FPGA
1999
ACM
15 years 7 months ago
1999
ACM
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
133
Voted
DAC
1997
ACM
15 years 7 months ago
1997
ACM
: Numerous fast algorithms for the Discrete Cosine Transform DCT have been proposed. Until recently, it has been di cult to compare di erent DCT algorithms and select one which i...
138
click to vote
CGF
2005
15 years 3 months ago
2005
Level set models combine a low-level volumetric representation, the mathematics of deformable implicit surfaces, and powerful, robust numerical techniques to produce a novel appro...
132
Voted
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
124
click to vote
DOCENG
2006
ACM
15 years 9 months ago
2006
ACM
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...