2924 search results - page 321 / 585 » Lower Bounds in Distributed Computing |
114
click to vote
AAAI
1996
15 years 5 months ago
1996
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...
129
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
118
click to vote
ET
2006
15 years 4 months ago
2006
Recent years have seen the emergence of dropletbased microfluidic systems for safety-critical biomedical applications. In order to ensure reliability, microsystems incorporating m...
155
click to vote
JCB
2008
15 years 4 months ago
2008
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
126
click to vote
IPL
2006
15 years 4 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...