| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 47
reviews
|
|
|
 |
|
|
|
|
An effective and versatile distance measure for spatiotemporal trajectories
Naderivesal S., Kulik L., Bailey J. Data Mining and Knowledge Discovery 33(3): 577-606, 2019. Type: Article
With the increasing accumulation of spatial temporal path data, such as in the truck and cab datasets considered here, the need for effective path comparison algorithms is of current importance. This paper develops a measure employing ...
|
Jan 9 2020 |
|
|
|
|
|
|
Reprint of "A parallel connectivity algorithm for de Bruijn graphs in metagenomic applications"
Flick P., Jain C., Pan T., Aluru S. Parallel Computing 70 54-65, 2017. Type: Article
Ed. note: This paper is a reprint, included in a special issue of Parallel Computing. It was identified by the ACM Artifact Review and Badging Initiative, and received the “Results Replicated” badge. The other papers in this ...
|
Apr 13 2018 |
|
|
|
|
|
|
A simple and efficient method with high order convergence for solving systems of nonlinear equations
Xiao X., Yin H. Computers & Mathematics with Applications 69(10): 1220-1231, 2015. Type: Article
Efficient methods for the solution of n-dimensional systems of nonlinear equations are critical for numerous applications. For the system F(x) = 0, the well-known Newton̵...
|
Sep 30 2015 |
|
|
|
|
|
|
On numerical modeling performance of generalized preconditioned methods
Gravvanis G., Filelis-Papadopoulos C., Lipitakis E. BCI 2013 (Proceedings of the 6th Balkan Conference in Informatics, Thessaloniki, Greece, Sep 19-21, 2013) 23-30, 2013. Type: Proceedings
The efficient solution of large sparse linear systems is critical for many applications, such as the one focused on in this paper. The problem arises from the discretization of elliptic boundary value problems and has a matrix with a s...
|
Dec 11 2013 |
|
|
|
|
|
|
 Approximate branch-and-bound global optimization using B-spline hypervolumes
Park S. Advances in Engineering Software 45(1): 11-20, 2012. Type: Article
Multidimensional unconstrained global optimization arises in a vast spectrum of applications, ranging from financial and physical to biological. Local methods cannot adequately deal with the often numerous local minima and other challe...
|
May 10 2012 |
|
|
|
|
|
|
A weighted voting summarization of SOM ensembles
Baruque B., Corchado E. Data Mining and Knowledge Discovery 21(3): 398-426, 2010. Type: Article
Strong visualization software is critical when one is interpreting the large volumes of data that are becoming increasingly common. An important technique for over two decades has been to use variants of the neural network self-organiz...
|
Jun 10 2011 |
|
|
|
|
|
|
A numerical evaluation of preprocessing and ILU-type preconditioners for the solution of unsymmetric sparse linear systems using iterative methods
Mayer J. ACM Transactions on Mathematical Software 36(1): 1-26, 2009. Type: Article
The efficient solution of large sparse linear systems is critical for a wide range of applications. An important approach, considered here for the unsymmetric case, employs an iterative framework with a preconditioner. The precondition...
|
Jul 12 2010 |
|
|
|
|
|
|
Non-linear MSD crack growth by DBEM for a riveted aeronautic reinforcement
Citarella R. Advances in Engineering Software 40(4): 253-259, 2009. Type: Article
Highly reliable software for predicting crack growth in aircraft parts is vital both for design and for determining a lifetime monitoring schedule. This work focuses on the development of a model for crack growth in a corner part of an...
|
Jun 23 2009 |
|
|
|
|
|
|
Software mechanisms for extensible and scalable 3D visualization of construction operations
Kamat V., Martinez J. Advances in Engineering Software 39(8): 659-675, 2008. Type: Article
An extensible animation system is presented for creating visualizations that aid in understanding the complex interactions associated with a construction project simulation. While the focus is exclusively on construction, common featur...
|
Dec 22 2008 |
|
|
|
|
|
|
Analysis of the properties of a linear system using the method of artificial basis matrices
Kudin V., Lyashko S., Khritonenko N., Yatsenko Y. Cybernetics and Systems Analysis 43(4): 563-570, 2007. Type: Article
The framework of the well-known simplex algorithm for linear programming is used to analyze systems of linear algebraic equations and linear algebraic inequalities....
|
May 28 2008 |
|
|
|
|
|
| |
|
|
| |
|
|
