Sciweavers

2944 search results - page 7 / 589
» On Well Quasi-orders on Languages
Sort
View
WEBDB
2009
Springer
100views Database» more  WEBDB 2009»
14 years 2 months ago
Towards Well-Behaved Schema Evolution
We study the problem of schema evolution in the RDF data model. RDF and the RDFS schema language are W3C standards for flexibly modeling and sharing data on the web. Although sch...
Rada Chirkova, George H. L. Fletcher
ICALP
2004
Springer
14 years 25 days ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
DLT
2006
13 years 8 months ago
Well-Founded Semantics for Boolean Grammars
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
NAACL
2010
13 years 5 months ago
Using Gaussian Mixture Models to Detect Figurative Language in Context
We present a Gaussian Mixture model for detecting different types of figurative language in context. We show that this model performs well when the parameters are estimated in an ...
Linlin Li, Caroline Sporleder