Sciweavers

2440 search results - page 201 / 488
» Data-Intensive Question Answering
Sort
View
JCT
2010
127views more  JCT 2010»
14 years 11 months ago
On the density of a graph and its blowup
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
Asaf Shapira, Raphael Yuster
JUCS
2010
159views more  JUCS 2010»
14 years 11 months ago
Authoring of Probabilistic Sequencing in Adaptive Hypermedia with Bayesian Networks
Abstract: One of the difficulties that self-directed learners face on their learning process is choosing the right learning resources. One of the goals of adaptive educational syst...
Sergio Gutiérrez Santos, Jaime Mayor-Berzal...
ICDT
2011
ACM
213views Database» more  ICDT 2011»
14 years 7 months ago
On provenance and privacy
Provenance in scientific workflows is a double-edged sword. On the one hand, recording information about the module executions used to produce a data item, as well as the parame...
Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Ju...
ICML
2007
IEEE
16 years 5 months ago
Fast and effective kernels for relational learning from texts
In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such mode...
Alessandro Moschitti, Fabio Massimo Zanzotto
CADE
2003
Springer
16 years 4 months ago
Canonization for Disjoint Unions of Theories
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
Sava Krstic, Sylvain Conchon