Sciweavers

4865 search results - page 560 / 973
» The Complexity of Graph Connectivity
Sort
View
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
15 years 8 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
194
Voted
WOB
2004
134views Bioinformatics» more  WOB 2004»
15 years 8 months ago
Reconstruction of Phylogenetic Trees using the Ant Colony Optimization Paradigm
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
Heitor S. Lopes, Mauricio Perretto
163
Voted
ACL
1998
15 years 8 months ago
Terminological Variation, a Means of Identifying Research Topics from Texts
After extracting terms from a corpus of titles and s in English, syntactic variation relations are identified amongst them in order to detect research topics. Three types of synta...
Fidelia Ibekwe-Sanjuan
GISCIENCE
2008
Springer
117views GIS» more  GISCIENCE 2008»
15 years 8 months ago
Refining Topological Relations between Regions Considering Their Shapes
Topological relations are sometimes insufficient for differentiating spatial configurations of two objects with critical difference in their connection styles. In this paper, we pr...
Roland Billen, Yohei Kurata
137
Voted
CORR
2010
Springer
51views Education» more  CORR 2010»
15 years 7 months ago
On ternary square-free circular words
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...
Arseny M. Shur