Sciweavers

3020 search results - page 90 / 604
» Optimal partition trees
Sort
View
ISAAC
2004
Springer
103views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
Ulrik Brandes, Jürgen Lerner
MLDM
2005
Springer
15 years 11 months 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é
162
Voted
IPPS
2010
IEEE
15 years 4 months ago
Adapting cache partitioning algorithms to pseudo-LRU replacement policies
Abstract-- Recent studies have shown that cache partitioning is an efficient technique to improve throughput, fairness and Quality of Service (QoS) in CMP processors. The cache par...
Kamil Kedzierski, Miquel Moretó, Francisco ...
BMCBI
2007
160views more  BMCBI 2007»
15 years 6 months ago
Dendroscope: An interactive viewer for large phylogenetic trees
Background: Research in evolution requires software for visualizing and editing phylogenetic trees, for increasingly very large datasets, such as arise in expression analysis or m...
Daniel H. Huson, Daniel C. Richter, Christian Raus...
DM
2000
81views more  DM 2000»
15 years 6 months ago
The optimal pebbling number of the complete m-ary tree
In this paper, we
Hung-Lin Fu, Chin-Lin Shiue