Sciweavers

1289 search results - page 13 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
DCC
2005
IEEE
16 years 7 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ICASSP
2007
IEEE
16 years 1 months ago
Oversampled Inverse Complex Lapped Transform Optimization
When an oversampled FIR filter bank structure is used for signal analysis, a main problem is to guarantee its invertibility and to be able to determine an inverse synthesis filt...
Jérôme Gauthier, Laurent Duval, Jean-...
AAAI
2010
15 years 9 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
COMPLEXITY
2004
108views more  COMPLEXITY 2004»
15 years 7 months ago
On the convergence of a factorized distribution algorithm with truncation selection
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
Qingfu Zhang
JAT
2010
171views more  JAT 2010»
15 years 2 months ago
Chebyshev approximation of the null function by an affine combination of complex exponential functions
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
Paul Armand, Joël Benoist, Elsa Bousquet