1220 search results - page 58 / 244 » Restricting grammatical complexity |
CPP
2011
12 years 7 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
DAGSTUHL
2006
13 years 9 months ago
2006
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
PAMI
2012
11 years 10 months ago
2012
— Most recent approaches to monocular non-rigid 3D shape recovery rely on exploiting point correspondences and work best when the whole surface is well-textured. The alternative ...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Discovering additive structure is an important step towards understanding a complex multi-dimensional function because it allows the function to be expressed as the sum of lower-d...
JMLR
2010
13 years 2 months ago
2010
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...