876 search results - page 20 / 176 » Complexity in geometric SINR |
COMPGEOM
1998
ACM
13 years 11 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
EUROGP
2007
Springer
13 years 9 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper is concerned with the problem of computing a discretecoefficient approximation to a digital filter. In contrast to earlier works that have approached this problem usi...
ICDIM
2007
IEEE
14 years 1 months ago
2007
IEEE
: A new video watermarking algorithm for access control is introduced. This method is content-dependent and uses the dual tree complex wavelet transform (DT CWT) to create a waterm...
FUN
2007
Springer
14 years 1 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...