113 search results - page 13 / 23 » Fast algorithms for discrete polynomial transforms |
SIAMAM
2002
14 years 10 months ago
2002
The theory of periodic wavelet transforms presented here was originally developed to deal with the problem of epileptic seizure prediction. A central theorem in the theory is the c...
105
click to vote
COCOA
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
107
click to vote
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
Short vector SIMD instructions on recent microprocessors, such as SSE on Pentium III and 4, speed up code but are a major challenge to software developers. We present a compiler t...
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
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...
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...