| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 54
reviews
|
|
|
 |
|
|
|
|
A method for directly finding the denominator values of rational interpolants
Zhu X., Zhu G. Journal of Computational and Applied Mathematics 148(2): 341-348, 2002. Type: Article
Interpolation with rational functions is performed by solving some system of linear equations. In this paper, the chosen algorithm directly yields the values of the denominator at the interpolation nodes. These values contain important...
|
Apr 24 2003 |
|
|
|
|
|
|
Kolmogorov random graphs only have trivial stable colorings
Cheng Q., Fang F. Information Processing Letters 81(3): 133-136, 2002. Type: Article
It has been shown that most random graphs with n vertices are rigid (specifically, they have only the identity automorphism), with exceptions declining exponentially with increasing n. This note e...
|
Mar 18 2003 |
|
|
|
|
|
|
Implementing Radau IIA methods for stiff delay differential equations
Guglielmi N., Hairer E. Computing 67(1): 1-12, 2001. Type: Article
Many models of immune response are given in terms of systems of ordinary delay differential equations. Attempts to solve these equations numerically face considerable challenges, which are discussed in this paper. Ways to adapt existin...
|
Jun 18 2002 |
|
|
|
|
|
|
Inferring evolutionary trees with strong combinatorial evidence
Berry V., Gascuel O. Theoretical Computer Science 240(2): 271-298, 2000. Type: Article
This paper deals with the problem of reconstructing an evolutionary tree from species data, such as DNA. For optimal results, NP-hard algorithms are needed. Given that, there is obvious interest in finding procedures that give satisfac...
|
Jan 1 2002 |
|
|
|
|
|
|
Optimal solution of nonlinear equations
Sikorski K., Oxford University Press, Inc., New York, NY, 2001. 238 pp. Type: Book (9780195106909)
Despite what its title may suggest, this is not a textbook for the practitioner or for classroom use. Rather, it is a research monograph that investigates the applications of computational complexity theory to the problem of approximat...
|
Jun 1 2001 |
|
|
|
|
|
|
Gadgets, approximation, and linear programming
Trevisan L., Sorkin G., Williamson D., Sudan M. SIAM Journal on Computing 29(6): 2074-2097, 2000. Type: Article
The goal of this work, in which combinatorial optimization problems are addressed, is to assign values to Boolean variables in order to satisfy as many constraints as possible and, specifically, to maximize the sum of some Boolean func...
|
Jan 1 2001 |
|
|
|
|
|
|
Topics in finite and discrete mathematics
Ross S., Cambridge University Press, New York, NY, 2000. 265 pp. Type: Book (9780521775717)
Courses in finite and discrete mathematics have become an integral part of the college curriculum, owing to the ever-increasing application of such tools, not only in engineering, but also in biology, sociology, and, of course, compute...
|
Sep 1 2000 |
|
|
|
|
|
|
Semidefinite programs and association schemes
Goemans M., Rendl F. Computing 63(4): 331-340, 1999. Type: Article
The authors show that semidefinite programs arising from association schemes can be reduced to linear programming problems. The symmetric semidefinite matrices in these problems commute and can, therefore, be simultaneously transformed...
|
Jun 1 2000 |
|
|
|
|
|
|
An implementation of a Fourier series method for the numerical inversion of the Laplace transform
D’Amore L., Laccetti G., Murli A. ACM Transactions on Mathematical Software 25(3): 279-305, 1999. Type: Article
A software package for the inversion of the Laplace transform using the Riemann inversion formula is described. This technique assumes, of course, that the transform is known in the complex plane, information not always available in en...
|
May 1 2000 |
|
|
|
|
|
|
Meta Analysis of Classification Algorithms for Pattern Recognition
Sohn S. IEEE Transactions on Pattern Analysis and Machine Intelligence 21(11): 1137-1144, 1999. Type: Article
The goal of this meta-analysis is to assess the performance of different classification algorithms as a function of the characteristics of the given data set. The classification algorithms considered include traditional statistical pro...
|
Feb 1 2000 |
|
|
|
|
|
| |
|
|
| |
|
|
