Sciweavers

2181 search results - page 104 / 437
» The restriction scaffold problem
Sort
View
CORR
1999
Springer
95views Education» more  CORR 1999»
13 years 9 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
CORR
2012
Springer
184views Education» more  CORR 2012»
12 years 5 months ago
Noisy-OR Models with Latent Confounding
Given a set of experiments in which varying subsets of observed variables are subject to intervention, we consider the problem of identifiability of causal models exhibiting late...
Antti Hyttinen, Frederick Eberhardt, Patrik O. Hoy...
JMLR
2012
12 years 13 days ago
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Carl Smith, Frank Wood, Liam Paninski
AAAI
2012
12 years 11 days ago
Fine-Grained Entity Recognition
Entity Recognition (ER) is a key component of relation extraction systems and many other natural-language processing applications. Unfortunately, most ER systems are restricted to...
Xiao Ling, Daniel S. Weld
ICDT
2009
ACM
149views Database» more  ICDT 2009»
14 years 10 months ago
Query languages for data exchange: beyond unions of conjunctive queries
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
Juan Reutter, Marcelo Arenas, Pablo Barceló