54 search results - page 5 / 11 » Proving Copyless Message Passing |
JACM
2008
14 years 9 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
104
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being app...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this work, we present a novel construction for solving the linear multiuser detection problem using the Gaussian Belief Propagation algorithm. Our algorithm yields an efficient,...
IPL
2006
14 years 9 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...