777 search results - page 74 / 156 » Declarative Data Cleaning: Language, Model, and Algorithms |
COLT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
CP
2007
Springer
14 years 3 months ago
2007
Springer
It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
COLING
2010
13 years 3 months ago
2010
We demonstrate the use of context features, namely, names of places, and unlabelled data for the detection of personal name language of origin. While some early work used either r...