2465 search results - page 338 / 493 » Automata on Linear Orderings |
173
click to vote
SETA
2004
Springer
15 years 12 months ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
141
click to vote
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
Control of variability and performance in the back end of the VLSI manufacturing line has become extremely difficult with the introduction of new materials such as copper and low...
192
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
188
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
125
click to vote
MSS
2000
IEEE
15 years 11 months ago
2000
IEEE
— We examine the primary challenges for building a practical and competitive holographic random access memory (HRAM) system, specifically size, speed, and cost. We show that a fa...