Sciweavers

8298 search results - page 1376 / 1660
» On the Complexity of Numerical Analysis
Sort
View
DAC
1999
ACM
15 years 11 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
DATE
1999
IEEE
135views Hardware» more  DATE 1999»
15 years 11 months ago
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
João P. Marques Silva, Thomas Glass
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
15 years 11 months ago
Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
Nicola Nicolici, Bashir M. Al-Hashimi
FOCS
1999
IEEE
15 years 11 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
ICMCS
1999
IEEE
119views Multimedia» more  ICMCS 1999»
15 years 11 months ago
Indexing by Shape of Image Databases Based on Extended Grid Files
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...
Carlo Combi, Gian Luca Foresti, Massimo Francesche...
« Prev « First page 1376 / 1660 Last » Next »