Sciweavers

571 search results - page 111 / 115
» Domain Theory in Logical Form
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 28 days ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
IPL
2007
105views more  IPL 2007»
14 years 9 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
100
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 17 hour ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
CADE
2005
Springer
15 years 10 months ago
Privacy-Sensitive Information Flow with JML
In today's society, people have very little control over what kinds of personal data are collected and stored by various agencies in both the private and public sectors. We de...
Guillaume Dufay, Amy P. Felty, Stan Matwin
DAWAK
2004
Springer
15 years 3 months ago
Conceptual Design of XML Document Warehouses
EXtensible Markup Language (XML) has emerged as the dominant standard in describing and exchanging data among heterogeneous data sources. XML with its self-describing hierarchical ...
Vicky Nassis, Rajagopal Rajugan, Tharam S. Dillon,...