A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
Laura Barbulescu, Jean-Paul Watson, L. Darrell Whi...
In this paper, we present a new deformable model — 2.5D Active Contour— that is capable of directly extracting shape geometry from 3D unorganized point cloud datasets. The rec...
This paper explores the increasing the heterogeneity of an agent population to stabilize decentralized systems by adding bias terms to each agent's expected payoffs. Two appr...
Many processes are composed of a n-fold repetition of some simpler process. If the whole process can be modeled with a neural network, we present a method to derive a model of the...