Sciweavers

170 search results - page 34 / 34
» Generalised Epipolar Constraints
Sort
View
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 4 months ago
Optimal measures and transition kernels
Abstract. We study positive measures that are solutions to an abstract optimisation problem, which is a generalisation of a classical variational problem with a constraint on infor...
Roman V. Belavkin
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
WLP
1997
Springer
13 years 11 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
TAICPART
2010
IEEE
126views Education» more  TAICPART 2010»
13 years 6 months ago
Improved Testing through Refactoring: Experience from the ProTest Project
We report on how the Wrangler refactoring tool has been used to improve and transform test code for Erlang systems. This has been achieved through the removal of code clones, the i...
Huiqing Li, Simon J. Thompson
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
13 years 11 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington