Sciweavers

JSC
2007
104views more  JSC 2007»
13 years 4 months ago
Summation algorithms for Stirling number identities
We consider a class of sequences defined by triangular recurrence equations. This class contains Stirling numbers and Eulerian numbers of both kinds, and hypergeometric multiples...
Manuel Kauers
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
13 years 7 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
ASAP
1997
IEEE
106views Hardware» more  ASAP 1997»
13 years 8 months ago
Libraries of schedule-free operators in Alpha
This paper presents a method, based on the formalism of affine recurrence equations, for the synthesis of digital circuits exploiting parallelism at the bit-level. In the initial ...
Florent de Dinechin
IPPS
2003
IEEE
13 years 9 months ago
PROSIDIS: A Special Purpose Processor for PROtein SImilarity DIScovery
This work presents the architecture of PROSIDIS, a special purpose processor designed to search for the occurrence of substrings similar to a given ‘template string’ within a ...
Alessandro Marongiu, Paolo Palazzari, Vittorio Ros...
QEST
2006
IEEE
13 years 10 months ago
On Single-Class Load-Dependent Normalizing Constant Equations
Normalizing constant recurrence equations play an important role in the exact analysis of load-independent (LI) product-form queueing networks. However, they have not been extende...
Giuliano Casale