Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
This paper presents a Hidden Markov Mesh Random Field (HMMRF) based approach for off-line handwritten Chinese characters recognition using statistical observation sequences embedd...
Qing Wang, Rongchun Zhao, Zheru Chi, David Dagan F...