Sciweavers

171 search results - page 4 / 35
» Maximally fast and arbitrarily fast implementation of linear...
Sort
View
COMPUTING
2006
112views more  COMPUTING 2006»
13 years 7 months ago
Fast Summation of Radial Functions on the Sphere
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
Jens Keiner, Stefan Kunis, Daniel Potts
ICCV
2011
IEEE
12 years 10 months ago
Fast Template Matching in Non-Linear Tone-Mapped Images
We propose a fast pattern matching scheme termed Matching by Tone Mapping (MTM) which allows matching under non-linear tone mappings. We show that, when tone mapping is approximate...
Yacov Hel-Or, Hagit Hel-Or and Eyal David
DSOM
2005
Springer
14 years 1 months ago
Design and Implementation of Performance Policies for SMS Systems
We present a design for policy-based performance management of SMS Systems. The design takes as input the operator’s performance goals, which are expressed as policies that can b...
Alberto Gonzalez Prieto, Rolf Stadler
ISBRA
2010
Springer
14 years 2 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang
ECOOPW
1998
Springer
13 years 12 months ago
A Rational Approach to Portable High Performance: The Basic Linear Algebra Instruction Set (BLAIS) and the Fixed Algorithm Size
Abstract. We introduce a collection of high performance kernels for basic linear algebra. The kernels encapsulate small xed size computations in order to provide building blocks fo...
Jeremy G. Siek, Andrew Lumsdaine