1713 search results - page 60 / 343 » Production programming in the classroom |
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
173
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
IBERAMIA
2004
Springer
15 years 3 months ago
2004
Springer
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part...
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
AWIC
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents an approach for applying inductive logic programming to information extraction from HTML documents structured as unranked ordered trees. We consider information...