Sciweavers

72 search results - page 2 / 15
» Reducing the Derivation of Redundant Clauses in Reasoning Sy...
Sort
View
ILP
2004
Springer
13 years 10 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
GLVLSI
2000
IEEE
116views VLSI» more  GLVLSI 2000»
13 years 9 months ago
Reducing bus transition activity by limited weight coding with codeword slimming
Transitions on high capacitance busses in VLSI systems result in considerable power dissipation. Various coding schemes have been proposed in literature to encode the input signal...
Vijay Sundararajan, Keshab K. Parhi
BMVC
2010
13 years 3 months ago
Reducing mismatching under time-pressure by reasoning about visibility and occlusion
Three methods are explored which help indicate whether feature points are potentially visible or occluded in the matching phase of the keyframe-based real-time visual SLAM system....
Somkiat Wangsiripitak, David W. Murray
PDPTA
2007
13 years 6 months ago
Suppressing Independent Loops in Packing/Unpacking Loop Nest to Reduce Message Size for Message-passing Code
- In this paper we experiment with two optimization techniques we are considering implementing in a parallelizing compiler that generates parallel code for a distributed-memory sys...
P. Jerry Martin, Clayton S. Ferner
ILP
2004
Springer
13 years 10 months ago
On Avoiding Redundancy in Inductive Logic Programming
ILP systems induce first-order clausal theories performing a search through very large hypotheses spaces containing redundant hypotheses. The generation of redundant hypotheses ma...
Nuno A. Fonseca, Vítor Santos Costa, Fernan...