1399 search results - page 35 / 280 » Multi-party Finite Computations |
143
Voted
DAC
1989
ACM
15 years 7 months ago
1989
ACM
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
138
Voted
DLT
2009
15 years 1 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
135
Voted
CONCUR
2000
Springer
15 years 8 months ago
2000
Springer
Concurrency is an essential element of abstract models for embedded systems. Correctness and e ciency of the design depend critically on the way concurrency is formalized and imple...
123
Voted
COLING
1992
15 years 4 months ago
1992
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
111
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...