575 search results - page 12 / 115 » Computing Maximum Subsequence in Parallel |
78
Voted
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
115
click to vote
ACL
1998
14 years 11 months ago
1998
This paper proposes a learning method of translation rules from parallel corpora. This method applies the maximum entropy principle to a probabilistic model of translation rules. ...
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—When applied in a commercial deployment, DHTbased P2P protocols face a dilemma: although most real-world participants are so unstable that the maintenance overhead is pr...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...