Computation of few Lyapunov exponents by geodesic based algorithms

Author： Del Buono N.   Elia C.  

Publisher： Elsevier

ISSN： 0167-739X

Source： Future Generation Computer Systems, Vol.19, Iss.3, 2003-04, pp. : 425-430

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Fast parallel DNA-based algorithms for molecular computation: discrete logarithm

By Chang Weng-Long   Huang Shu-Chien   Lin Kawuu   Ho Michael  

The Journal of Supercomputing, Vol. 56, Iss. 2, 2011-05 ,pp. : 129-163

Springer Publishing Company

Access to resources Recommend Favorite

Preliminary experiments in speaker verification using time-dependent largest Lyapunov exponents

By Petry A.   Barone D.A.C.  

Computer Speech & Language, Vol. 17, Iss. 4, 2003-10 ,pp. : 403-413

Elsevier

Access to resources Recommend Favorite

Handling degenerate cases in exact geodesic computation on triangle meshes

By Liu Yong-Jin  

The Visual Computer, Vol. 23, Iss. 9-11, 2007-09 ,pp. : 661-668

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms and analyses for maximal vector computation

By Godfrey Parke  

The VLDB Journal, Vol. 16, Iss. 1, 2007-01 ,pp. : 5-28

Springer Publishing Company

Access to resources Recommend Favorite

Geodesic Based Ink Separation for Spectral Printing

By Bastani Behnam   Funt Brian  

Color and Imaging Conference, Vol. 2008, Iss. 1, 2008-01 ,pp. : 67-72

Society for Imaging Science and Technology

Access to resources Recommend Favorite