1554 search results - page 209 / 311 » Parameterized Complexity and Approximation Algorithms |
130
click to vote
CPM
2004
Springer
15 years 6 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
134
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
109
click to vote
MP
2008
15 years 3 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
122
click to vote
TOG
2008
15 years 3 months ago
2008
We introduce a meshless hierarchical representation for solving light transport problems. Precomputed radiance transfer (PRT) and finite elements require a discrete representation...
114
click to vote
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— The least-mean square (LMS) decision-feedback equalizer (DFE) was previously shown [1], [2] to possess an extended convergence time in an interference limited environment. In [...