876 search results - page 20 / 176 » Complexity in geometric SINR |
172
click to vote
COMPGEOM
1998
ACM
15 years 10 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...
191
click to vote
EUROGP
2007
Springer
15 years 7 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...
156
click to vote
ICASSP
2009
IEEE
16 years 17 days 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...
151
Voted
ICDIM
2007
IEEE
16 years 4 days 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...
132
click to vote
FUN
2007
Springer
16 years 4 hour 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...