2553 search results - page 350 / 511 » Modeling Trees with Hypertextures |
90
Voted
FPGA
1999
ACM
15 years 2 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
123
click to vote
ISPD
1997
ACM
15 years 2 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
101
click to vote
MM
1993
ACM
15 years 2 months ago
1993
ACM
as a tree which specifies the presentation in an abstract, machineindependent way. This specification is created and edited using an authoring system; it is mapped to a particula...
CSB
2004
IEEE
15 years 1 months ago
2004
IEEE
The recognition of regulatory motifs of co-regulated genes is essential for understanding the regulatory mechanisms. However, the automatic extraction of regulatory motifs from a ...
82
Voted
CIE
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...