4212 search results - page 799 / 843 » On Compressible Pairings and Their Computation |
177
click to vote
TCS
2010
15 years 4 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
147
click to vote
TCS
2010
15 years 4 months ago
2010
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
189
click to vote
WABI
2010
Springer
15 years 4 months ago
2010
Springer
Background: Although many RNA molecules contain pseudoknots, computational prediction of pseudoknotted RNA structure is still in its infancy due to high running time and space con...
166
click to vote
WIOPT
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...
153
click to vote
ACMSE
2010
ACM
15 years 4 months ago
2010
ACM
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...