Sciweavers

716 search results - page 40 / 144
» time 1997
Sort
View
KGC
1997
Springer
15 years 4 months ago
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic t...
Samuel R. Buss
FPGA
1997
ACM
142views FPGA» more  FPGA 1997»
15 years 4 months ago
Architectural and Physical Design Challenges for One-Million Gate FPGAs and Beyond
Process technology advances tell us that the one-million gate Field-Programmable Gate Array (FPGA) will soon be here, and larger devices shortly after that. We feel that current a...
Jonathan Rose, Dwight D. Hill
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
15 years 4 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
Erich Kaltofen, Victor Shoup
ALC
1997
15 years 1 months ago
Predicative semantics of loops
A predicative semantics is a mapping of programs to predicates. These predicates characterize sets of acceptable observations. The presence of time in the observations makes the o...
Theodore S. Norvell
BNT
1997
15 years 1 months ago
Tag-switching architecture: overview
Tag switching is a way to combine the label-swapping forwarding paradigm with network layer routing. This has several advantages. Tags can have a wide spectrum of forwarding granu...
Yakov Rekhter