Sciweavers

160 search results - page 25 / 32
» On the diagonalization of the discrete Fourier transform
Sort
View
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 6 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
WSCG
2004
146views more  WSCG 2004»
13 years 8 months ago
Frequency-based Operators for Freeform Feature Shape Reuse
Freeform feature shape reuse is an important issue in industrial design supporting. In this paper, the frequencybased operators for freeform feature shape reuse are discussed. Unl...
Chensheng Wang, Joris S. M. Vergeest, Yu Song
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 8 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
SIGMETRICS
2006
ACM
121views Hardware» more  SIGMETRICS 2006»
14 years 1 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...
COMPGEOM
1996
ACM
13 years 11 months ago
Flipping Edges in Triangulations
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
Ferran Hurtado, Marc Noy, Jorge Urrutia