4 search results - page 1 / 1 » Turing Degrees of Certain Isomorphic Images of Computable Re... |
APAL
1998
13 years 10 months ago
1998
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
MST
2010
13 years 9 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
COLT
1994
Springer
14 years 3 months ago
1994
Springer
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
MVA
2007
14 years 9 days ago
2007
Object tracking in computer vision refers to the task of tracking individual moving objects accurately from one frame to another in an image sequence. Several tracking methods hav...