Sciweavers

680 search results - page 45 / 136
» A randomized embedding algorithm for trees
Sort
View
TON
2008
126views more  TON 2008»
13 years 8 months ago
Hyperbolic embedding of internet graph for distance estimation and overlay construction
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...
Yuval Shavitt, Tomer Tankel
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 3 months ago
Evolutionary algorithms and matroid optimization problems
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...
Joachim Reichel, Martin Skutella
ICNC
2005
Springer
14 years 2 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
FSTTCS
2001
Springer
14 years 1 months ago
On Clustering Using Random Walks
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...
David Harel, Yehuda Koren
ICPR
2000
IEEE
14 years 1 months ago
Hidden Markov Random Field Based Approach for Off-Line Handwritten Chinese Character Recognition
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...