Sciweavers

145 search results - page 11 / 29
» Fast, Randomized Join-Order Selection - Why Use Transformati...
Sort
View
ICIP
2001
IEEE
16 years 1 months ago
A directional, shift insensitive, low-redundancy, wavelet transform
Shift variance and poor directional selectivity, two major disadvantages of the discrete wavelet transform, have previously been circumvented either by using highly redundant, non...
Rutger L. van Spaendonck, Felix C. A. Fernandes, S...

Book
19360views
16 years 11 months ago
Numerical Recipes in C
C code implementation of several math algorithms such as Linear Algebraic Equations, Interpolation and Extrapolation, Integration of Functions, Evaluation of Functions, Random Num...
William H. Press, Saul A. Teukolsky, William T. Ve...
IJCAI
2007
15 years 1 months ago
Fast Image Alignment Using Anytime Algorithms
Image alignment refers to finding the best transformation from a fixed reference image to a new image of a scene. This process is often guided by similarity measures between ima...
Rupert Brooks, Tal Arbel, Doina Precup
106
Voted
IJIT
2004
15 years 1 months ago
Morphing Human Faces: Automatic Control Points Selection And Color Transition
In this paper, we propose a morphing method by which face color images can be freely transformed. The main focus of this work is the transformation of one face image to another. Th...
Stephen Karungaru, Minoru Fukumi, Norio Akamatsu
CIKM
2009
Springer
15 years 7 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...