Sciweavers

9626 search results - page 482 / 1926
» Invariant Based Programming
Sort
View
IROS
2008
IEEE
122views Robotics» more  IROS 2008»
16 years 1 months ago
A probabilistic Programming by Demonstration framework handling constraints in joint space and task space
— We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for ge...
Sylvain Calinon, Aude Billard
KBSE
2008
IEEE
16 years 1 months ago
How Program History Can Improve Code Completion
Code completion is a widely used productivity tool. It takes away the burden of remembering and typing the exact names of methods or classes: As a developer starts typing a name, ...
Romain Robbes, Michele Lanza
255
Voted
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
16 years 1 months ago
A convex programming approach for color stereo matching
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
Wided Miled, Béatrice Pesquet-Popescu, Jean...
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
16 years 1 months ago
An Integer Linear Programming Approach to Database Design
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
Stratos Papadomanolakis, Anastassia Ailamaki
ICTAI
2007
IEEE
16 years 1 months ago
ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming
In this paper we developed an Inductive Logic Programming (ILP) based framework ExOpaque that is able to extract a set of Horn clauses from an arbitrary opaque machine learning mo...
Yunsong Guo, Bart Selman