557 search results - page 68 / 112 » Learning programs from noisy data |
118
Voted
SEMWEB
2004
Springer
15 years 8 months ago
2004
Springer
We argue that in a distributed context, such as the Semantic Web, ontology engineers and data creators often cannot control (or even imagine) the possible uses their data or ontolo...
131
click to vote
ILP
2004
Springer
15 years 8 months ago
2004
Springer
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
160
click to vote
JMLR
2010
14 years 9 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
102
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— In this paper, a novel multiple target localization approach is proposed by exploiting the compressive sensing theory, which indicates that sparse or compressible signa...
134
Voted
ISPASS
2009
IEEE
15 years 9 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...