On the complexity of finding common approximate substrings

By Evans P.A.   Smith A.D.   Wareham H.T.  

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 407-430

Elsevier

Access to resources Recommend Favorite

Design guidelines and models for PMSMs with non-overlapping concentrated windings

By Soulard Juliette   Meier Florence  

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 30, Iss. 1, 2011-01 ,pp. : 72-83

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Non-overlapping preconditioners for a parallel implicit Navier-Stokes solver

By Issman E.   Degrez G.  

Future Generation Computer Systems, Vol. 13, Iss. 4, 1998-03 ,pp. : 303-313

Elsevier

Access to resources Recommend Favorite

Two-Level Non-Overlapping Schwarz Preconditioners for a Discontinuous Galerkin Approximation of the Biharmonic Equation

By Feng Xiaobing   Karakashian Ohannes  

Journal of Scientific Computing, Vol. 22, Iss. 1-3, 2005-06 ,pp. : 289-314

Springer Publishing Company

Access to resources Recommend Favorite

On parsing and condensing substrings of LR languages in linear time

By Goeman H.  

Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. : 61-82

Elsevier

Access to resources Recommend Favorite