Sciweavers

778 search results - page 96 / 156
» Bounding Smooth Integers
Sort
View
ANTS
1994
Springer
105views Algorithms» more  ANTS 1994»
13 years 11 months ago
A fast variant of the Gaussian reduction algorithm
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...
Michael Kaib
FPGA
1995
ACM
120views FPGA» more  FPGA 1995»
13 years 11 months ago
Synthesis of Signal Processing Structured Datapaths for FPGAs Supporting RAMs and Busses
A novel approach is presented for transforming a given scheduled and bound signal processing algorithm for a multiplexer based datapath to a BUS/RAM based FPGA datapath. A datapat...
Baher Haroun, Behzad Sajjadi
SAS
1991
Springer
13 years 11 months ago
Polymorphic Time Systems for Estimating Program Complexity
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
Vincent Dornic, Pierre Jouvelot, David K. Gifford
DAC
2005
ACM
13 years 9 months ago
Normalization at the arithmetic bit level
We propose a normalization technique for verifying arithmetic circuits in a bounded model checking environment. Our technique operates on the arithmetic bit level (ABL) descriptio...
Markus Wedler, Dominik Stoffel, Wolfgang Kunz
APVIS
2007
13 years 9 months ago
Straight-line grid drawings of planar graphs with linear area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
Md. Rezaul Karim, Md. Saidur Rahman