6939 search results - page 1082 / 1388 » Algorithm Engineering for Parallel Computation |
140
click to vote
COLING
2010
14 years 11 months ago
2010
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
176
Voted
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with c...
126
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In this paper, we address this ...
152
Voted
COCO
2005
Springer
15 years 10 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
145
click to vote
SIAMSC
2008
15 years 4 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...