3466 search results - page 84 / 694 » Fast computation of special resultants |
85
Voted
DAC
2004
ACM
15 years 6 months ago
2004
ACM
Considering layout effects early in the analog design process is becoming increasingly important. We propose techniques for estimating parasitic capacitances based on look-up tabl...
104
click to vote
IAJIT
2006
15 years 21 days ago
2006
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its dat...
89
Voted
TCSV
2008
15 years 18 days ago
2008
Edge is an important feature in video classification which finds applications in video representation and coding. In H.264/AVC, intra-prediction mode decision (a computationally in...
MOC
1998
15 years 11 days ago
1998
Abstract. The Fast Multipole Method (FMM) designed by V. Rokhlin rapidly computes the field scattered from an obstacle. This computation consists of solving an integral equation o...
103
Voted
DAC
1999
ACM
16 years 1 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...