Sciweavers

2519 search results - page 300 / 504
» Reasoning with Textual Cases
Sort
View
FLOPS
2004
Springer
15 years 12 months ago
Basic Pattern Matching Calculi: a Fresh View on Matching Failure
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
Wolfram Kahl
ILP
2004
Springer
15 years 12 months ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...
MDAFA
2004
Springer
178views Hardware» more  MDAFA 2004»
15 years 12 months ago
Model Bus: Towards the Interoperability of Modelling Tools
MDA software development requires the interoperability of a wide range of modelling services (operations taking models as inputs and outputs), such as model edition, model transfor...
Xavier Blanc, Marie-Pierre Gervais, Prawee Sriplak...
PRICAI
2004
Springer
15 years 12 months ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann
ECCV
2010
Springer
15 years 12 months ago
Visibility Subspaces: Uncalibrated Photometric Stereo with Shadows
Photometric stereo relies on inverting the image formation process, and doing this accurately requires reasoning about the visibility of light sources with respect to each image po...