Sciweavers

616 search results - page 113 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
RECOMB
2005
Springer
14 years 7 months ago
Constructing a Smallest Refining Galled Phylogenetic Network
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary his...
Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguy...
SOFSEM
2000
Springer
13 years 11 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
MLDM
2005
Springer
14 years 29 days ago
Supervised Evaluation of Dataset Partitions: Advantages and Practice
In the context of large databases, data preparation takes a greater importance : instances and explanatory attributes have to be carefully selected. In supervised learning, instanc...
Sylvain Ferrandiz, Marc Boullé
EWSN
2008
Springer
14 years 7 months ago
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search
We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static tr...
André Schumacher, Harri Haanpää, ...
FIMI
2003
210views Data Mining» more  FIMI 2003»
13 years 8 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj