This paper deals with the problem of recognizing and extracting acronymdefinition pairs in Swedish medical texts. This project applies a rule-based method to solve the acronym rec...
We develop a novel method for fitting high-resolution template meshes to detailed human body range scans with sparse 3D markers. We formulate an optimization problem in which the ...
The problem of counting the number of monomer-dimer coverings of a lattice comes from the field of statistical mechanics. It has only been shown to be exactly solved for the speci...
Nick Anzalone, John Baldwin, Ilya Bronshtein, T. K...
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...