Sciweavers

146 search results - page 17 / 30
» The Fast Generalized Gauss Transform
Sort
View
CW
2002
IEEE
14 years 1 months ago
A Practical Image Retouching Method
In this paper, we present a novel fast algorithmfor image retouching. A space-mapping technique is used to transform a missing (or damaged) part of a surface into a different shap...
Vladimir V. Savchenko, Nikita Kojekine, Hiroshi Un...
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
14 years 8 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
VLDB
2006
ACM
124views Database» more  VLDB 2006»
14 years 8 months ago
Query optimization in XML structured-document databases
While the information published in the form of XML-compliant documents keeps fast mounting up, efficient and effective query processing and optimization for XML have now become mor...
Dunren Che, Karl Aberer, M. Tamer Özsu
SIGMETRICS
2006
ACM
121views Hardware» more  SIGMETRICS 2006»
14 years 2 months ago
Transient analysis of tree-Like processes and its application to random access systems
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
Jeroen Van Velthoven, Benny Van Houdt, Chris Blond...
ICFP
1997
ACM
14 years 19 days ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves