1022 search results - page 5 / 205 » Logspace Complexity of Functions and Structures |
JMLR
2012
13 years 3 days ago
2012
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
93
Voted
CNL
2009
14 years 10 months ago
2009
Abstract. As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness....
90
Voted
STACS
1994
Springer
15 years 1 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
COMPLEX
2009
Springer
15 years 4 months ago
2009
Springer
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...
COLT
2001
Springer
15 years 2 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...