Sciweavers

194 search results - page 15 / 39
» Better polynomials for GNFS
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Region-based image fusion using a combinatory Chebyshev-ICA method
The aim of this paper is to provide an algorithm for image fusion which combines the techniques of Chebyshev polynomial (CP) approximation and independent component analysis (ICA)...
Zaid Omar, Nikolaos Mitianoudis, Tania Stathaki
ICASSP
2011
IEEE
13 years 1 months ago
Fourier expansion of hammerstein models for nonlinear acoustic system identification
We consider the task of acoustic system identification, where the input signal undergoes a memoryless nonlinear transformation before convolving with an unknown linear system. We...
Sarmad Malik, Gerald Enzner
JACM
2007
132views more  JACM 2007»
13 years 9 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
MOR
2002
94views more  MOR 2002»
13 years 9 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
ATAL
2006
Springer
14 years 1 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara