1071 search results - page 57 / 215 » Theories of Automatic Structures and Their Complexity |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
WIDM
2003
ACM
14 years 1 months ago
2003
ACM
At the present time, several shortcomings prevent the more effective use and more intense application of web information systems. Recent developments that are subsumed by the term...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
SEMCO
2009
IEEE
14 years 2 months ago
2009
IEEE
—This is a paper about a new resource, namely an English paraphrase dictionary extracted from the FrameNet lexicon and its example data base. I. THE LEXPAR PARAPHRASE DICTIONARY ...
MPC
2004
Springer
14 years 1 months ago
2004
Springer
Unfolds generate data structures, and folds consume them. A hylomorphism is a fold after an unfold, generating then consuming a virtual data structure. A metamorphism is the opposi...