Sciweavers

7868 search results - page 162 / 1574
» Learning by Answer Sets
Sort
View
APAL
2008
63views more  APAL 2008»
15 years 4 months ago
A standard model of Peano arithmetic with no conservative elementary extension
The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically cl...
Ali Enayat
CINQ
2004
Springer
123views Database» more  CINQ 2004»
15 years 10 months ago
One-Sided Instance-Based Boundary Sets
Abstract. Instance retraction is a difficult problem for concept learning by version spaces. This chapter introduces a family of version-space representations called one-sided inst...
Evgueni N. Smirnov, Ida G. Sprinkhuizen-Kuyper, H....
FIMH
2009
Springer
15 years 2 months ago
Discriminative Joint Context for Automatic Landmark Set Detection from a Single Cardiac MR Long Axis Slice
Cardiac magnetic resonance (MR) imaging has advanced to become a powerful diagnostic tool in clinical practice. Automatic detection of anatomic landmarks from MR images is importan...
Xiaoguang Lu, Bogdan Georgescu, Arne Littmann, Edg...
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
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
13 years 7 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...