63 search results - page 3 / 13 » On Extending the Complex FastICA Algorithm to Noncircular So... |
COCO
2010
Springer
13 years 11 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
Spread Transform (ST) is a quantization watermarking algorithm in which vectors of the wavelet coefficients of a host work are quantized, using one of two dithered quantizers, to ...
CGVR
2006
13 years 8 months ago
2006
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
SIGMOD
2000
ACM
13 years 11 months ago
2000
ACM
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...