Sciweavers

9176 search results - page 115 / 1836
» algorithms 2010
Sort
View
NHM
2010
83views more  NHM 2010»
14 years 11 months ago
Schwarz waveform relaxation algorithms for semilinear reaction-diffusion equations
We introduce nonoverlapping domain decomposition algorithms of Schwarz waveform relaxation type for the semilinear reaction-diffusion equation. We define linear Robin and second or...
Filipa Caetano, Martin J. Gander, Laurence Halpern...
CCCG
2010
15 years 5 months ago
A new algorithm and improved lower bound for point placement on a line in two rounds
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
Md. Shafiul Alam, Asish Mukhopadhyay
BMCBI
2010
135views more  BMCBI 2010»
15 years 4 months ago
MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
Suzanne Matthews, Tiffani L. Williams
ENDM
2010
101views more  ENDM 2010»
15 years 4 months ago
Finding Gale Strings
Electronic Notes in Discrete Mathematics 36 (2010) 1065
Marta M. Casetti, Julian Merschen, Bernhard von St...
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 1 months ago
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
Abstract. In this paper a tight bound on the worst-case number of comparisons for Floyd's well known heap construction algorithm, is derived. It is shown that at most 2n - 2
Ioannis K. Paparrizos