14518 search results - page 75 / 2904 » Two Problems for Sophistication |
COCOON
2001
Springer
14 years 2 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
EUROCRYPT
2007
Springer
14 years 2 months ago
2007
Springer
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this...
AMDO
2006
Springer
14 years 1 months ago
2006
Springer
We present a theoretical and computational framework for matching of two-dimensional articulated shapes. Assuming that articulations can be modeled as near-isometries, we show an a...
EMNLP
2007
13 years 11 months ago
2007
We present a two-stage multilingual dependency parsing system submitted to the Multilingual Track of CoNLL-2007. The parser first identifies dependencies using a deterministic p...
EWC
2006
13 years 10 months ago
2006
We compare inexact Newton and block coordinate descent optimization methods for improving the quality of a mesh by repositioning the vertices, where the overall quality is measure...