Sciweavers

178 search results - page 16 / 36
» Martin's maximum revisited
Sort
View
STACS
2010
Springer
15 years 4 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
ICASSP
2011
IEEE
14 years 1 months ago
On single-channel noise reduction in the time domain
In this paper, we revisit the noise-reduction problem in the time domain and present a way to decompose the ltered speech into two uncorrelated (orthogonal) components: the desire...
Jingdong Chen, Jacob Benesty, Yiteng Huang, Tomas ...
ICDIM
2007
IEEE
15 years 3 months ago
Biorthogonal matrix dirty paper coding for information hiding in still images
In this paper, a new method of dirty paper code design is investigated, namely the biorthogonal matrix. The error probability is analysed for the code design. Since the code has t...
Xin Xu, Martin Tomlinson, Marcel Ambroze, Mohammed...
EMO
2003
Springer
136views Optimization» more  EMO 2003»
15 years 2 months ago
Solving Multi-criteria Optimization Problems with Population-Based ACO
In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set...
Michael Guntsch, Martin Middendorf
CIAC
2010
Springer
278views Algorithms» more  CIAC 2010»
15 years 2 months ago
Maximizing PageRank with new Backlinks
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
Martin Olsen