1951 search results - page 328 / 391 » An algorithm for improving graph partitions |
95
Voted
CONCUR
2008
Springer
14 years 12 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
102
Voted
SWAT
2010
Springer
14 years 8 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
107
Voted
WWW
2011
ACM
14 years 5 months ago
2011
ACM
Once information retrieval has located a document, and information extraction has provided its contents, how do we know whether we should actually believe it? Fact-finders are a ...
102
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
83
Voted
BIBE
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...