2168 search results - page 32 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
Conventional methods for recognizing multiple fonts and handwriting are generally robust against deformation but are weak against degradation. This paper proposes a category-depen...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...
IPL
1998
13 years 7 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
ACL
2011
12 years 11 months ago
2011
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...