Sciweavers

450 search results - page 52 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
CAV
2008
Springer
131views Hardware» more  CAV 2008»
13 years 10 months ago
Validating High-Level Synthesis
The growing design-productivity gap has made designers shift toward using high-level languages like C, C++ and Java to do system-level design. High-Level Synthesis (HLS) is the pro...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta
RC
1998
82views more  RC 1998»
13 years 8 months ago
A Note on Epsilon-Inflation
Abstract. The epsilon-inflation proved to be useful and necessary in many verification algorithms. Different definitions of an epsilon-inflation are possible, depending on the...
Siegfried M. Rump
APPT
2009
Springer
14 years 24 days ago
Efficient Multiplication of Polynomials on Graphics Hardware
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...
Pavel Emeliyanenko
ICALP
1993
Springer
14 years 27 days ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
CAGD
1998
99views more  CAGD 1998»
13 years 8 months ago
A Laguerre geometric approach to rational offsets
Laguerre geometry provides a simple approach to the design of rational curves and surfaces with rational offsets. These so-called PH curves and PN surfaces can be constructed from...
Martin Peternell, Helmut Pottmann