Sciweavers

698 search results - page 51 / 140
» Fast functional simulation using branching programs
Sort
View
COMPUTING
2002
80views more  COMPUTING 2002»
15 years 1 months ago
A Method for Approximate Inversion of the Hyperbolic CDF
It has been observed by E. Eberlein and U. Keller that the hyperbolic distribution fits logarithmic rates of returns of a stock much better than the normal distribution. We give a...
Gunther Leobacher, Friedrich Pillichshammer
IEEEPACT
1997
IEEE
15 years 5 months ago
A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
Yu-Kwong Kwok, Ishfaq Ahmad
PRL
2006
96views more  PRL 2006»
15 years 1 months ago
Fast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh
GRAPHICSINTERFACE
1997
15 years 2 months ago
Linear Fractal Shape Interpolation
Interpolation of two-dimensional shapes described by iterated function systems is explored. Iterated function systems define shapes using self-transformations, and interpolation ...
Brandon Burch, John Hart
ICLP
2007
Springer
15 years 7 months ago
Static Region Analysis for Mercury
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...
Quan Phan, Gerda Janssens