Sciweavers

595 search results - page 46 / 119
» Languages Of Analogical Strings
Sort
View
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 4 days ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
ICML
2005
IEEE
15 years 10 months ago
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
Shaojun Wang, Shaomin Wang, Russell Greiner, Dale ...

Book
2455views
16 years 7 months ago
Art of Programming Contest - C Programming Tutorials | Data Structures | Algorithms
"The objective of this edition is not only to assist the contestants during the contest hours but also describing the core subjects of Computer Science such as C Programming, ...
Ahmed Shamsul Arefin
FSTTCS
2007
Springer
15 years 3 months ago
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg , a further variant where solutions are constrained ...
Pierre Chambart, Ph. Schnoebelen
RML
2002
162views Business» more  RML 2002»
14 years 9 months ago
A Markup Language for ORM Business Rules
Conceptual modeling techniques such as EER, ORM and to some extent the UML have been developed in the past for building information systems. These techniques or suitable extensions...
Jan Demey, Mustafa Jarrar, Robert Meersman