Sciweavers

170 search results - page 7 / 34
» On computational properties of chains of recurrences
Sort
View
MOC
1998
107views more  MOC 1998»
13 years 7 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche
FCS
2006
13 years 8 months ago
A Theoretical Study of Parallel Voronoi Diagram
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...
Rashid Muhammad
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 6 months ago
BioBlender: a Software for Intuitive Representation of Surface Properties of Biomolecules
In this and the associated article BioBlender: A Software for Intuitive Representation of Surface Properties of Biomolecules [1], we present BioBlender as a complete instrument fo...
Raluca Mihaela Andrei, Marco Callieri, Maria Franc...
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
13 years 11 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
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
13 years 9 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...