Sciweavers

1099 search results - page 96 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
RECOMB
2000
Springer
15 years 1 months ago
A compression algorithm for DNA sequences and its applications in genome comparison
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
Xin Chen, Sam Kwong, Ming Li
AAMAS
2012
Springer
13 years 5 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
NIPS
2007
14 years 11 months ago
Anytime Induction of Cost-sensitive Trees
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
Saher Esmeir, Shaul Markovitch
GECCO
2009
Springer
118views Optimization» more  GECCO 2009»
15 years 4 months ago
The impact of network topology on self-organizing maps
In this paper, we study instances of complex neural networks, i.e. neural networks with complex topologies. We use Self-Organizing Map neural networks whose neighborhood relations...
Fei Jiang, Hugues Berry, Marc Schoenauer
ICIP
2006
IEEE
15 years 11 months ago
Region Based Segmentation Using the Tree of Shapes
The tree of shapes is a powerful tool for image representation which holds many interesting properties. There are many works in the literature that use it for image segmentation, ...
Gregory Randall, Juan Cardelino, Marcelo Bertalm&i...