We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability m...
Robert Krauthgamer, James R. Lee, Manor Mendel, As...
Reduplication, a central instance of prosodic morphology, is particularly challenging for state-ofthe-art computational morphology, since it involves copying of some part of a pho...
The finite element (FE) mesh sizing has great influence on computational time, memory usage, and accuracy of FE analysis. Based on a systematic in-depth study of the geometric com...
William Roshan Quadros, Steven J. Owen, Michael L....
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...