1951 search results - page 176 / 391 » An algorithm for improving graph partitions |
115
click to vote
CORR
2009
Springer
15 years 2 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
146
Voted
WOSP
2005
ACM
15 years 10 months ago
2005
ACM
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
138
Voted
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
165
click to vote
EWCBR
2006
Springer
15 years 8 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
132
click to vote
EDBT
2010
ACM
15 years 8 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...