Sciweavers

616 search results - page 70 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
VRST
2009
ACM
14 years 2 months ago
Indexing and retrieval of human motion data by a hierarchical tree
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
Shuangyuan Wu, Zhaoqi Wang, Shihong Xia
TAMC
2010
Springer
13 years 6 months ago
Two-Layer Planarization Parameterized by Feedback Edge Set
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
Johannes Uhlmann, Mathias Weller
CSB
2005
IEEE
136views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Whole Genome Phylogeny Based on Clustered Signature String Composition
Peptide compositions constructed out of whole sets of protein sequences can be used as species signatures for phylogenetic analysis. To account for point mutations, an amino acid ...
Xiaomeng Wu, Guohui Lin, Xiu-Feng Wan, Dong Xu
CICLING
2010
Springer
13 years 11 months ago
A General Bio-inspired Method to Improve the Short-Text Clustering Task
"Short-text clustering" is a very important research field due to the current tendency for people to use very short documents, e.g. blogs, text-messaging and others. In s...
Diego Ingaramo, Marcelo Errecalde, Paolo Rosso
ADHOCNOW
2007
Springer
14 years 1 months ago
Routing in Wireless Networks with Position Trees
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
Edgar Chávez, Nathalie Mitton, Hécto...