Sciweavers

411 search results - page 33 / 83
» Automating the Dependency Pair Method
Sort
View
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
13 years 8 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
TARK
1998
Springer
14 years 1 months ago
The Learning Power of Belief Revision
Belief revision theory aims to describe how one should change one's beliefs when they are contradicted by newly input information. The guiding principle of belief revision th...
Kevin T. Kelly
RTA
2005
Springer
14 years 3 months ago
Orderings for Innermost Termination
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
Mirtha-Lina Fernández, Guillem Godoy, Alber...
TPHOL
2008
IEEE
14 years 4 months ago
Certifying a Termination Criterion Based on Graphs, without Graphs
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Pierre Courtieu, Julien Forest, Xavier Urbain
GI
2009
Springer
13 years 7 months ago
An Evolutionary Strategy for Model-based Segmentation of Medical Data
: Medical image segmentation often involves variants of deformable models to account for both the variability of object shapes and variation in image quality. Segmentation quality,...
Karin Engel, Klaus D. Toennies