Abstract. Belief propagation (BP) is the calculation method which enables us to obtain the marginal probabilities with a tractable computational cost. BP is known to provide true m...
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
This paper outlines our experiences with making architectural tradeoffs between performance, availability, security, and usability, in light of stringent cost and time-to-market c...
T. C. Nicholas Graham, Rick Kazman, Chris Walmsley
This paper investigates a mechanism for reliable generation of sparse code in a sparsely connected, hierarchical, learning memory. Activity reduction is accomplished with local com...
Linear systems with structures such as Toeplitz-, Vandermonde- or Cauchy-likeness can be solved in O˜(α2 n) operations, where n is the matrix size, α is its displacement rank, ...