4112 search results - page 59 / 823 » Efficient Algorithms for the Spoonerism Problem |
144
Voted
JCSS
2002
15 years 3 months ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
116
click to vote
NHM
2010
14 years 10 months ago
2010
We introduce nonoverlapping domain decomposition algorithms of Schwarz waveform relaxation type for the semilinear reaction-diffusion equation. We define linear Robin and second or...
122
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is ap...
147
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
117
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
The storage requirements in data-intensive multidimensional signal processing systems have a significant impact on the system performance as well as on essential design parameter...