Sciweavers

559 search results - page 40 / 112
» Dependency Inference
Sort
View
HASKELL
2006
ACM
14 years 2 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
CORR
2012
Springer
212views Education» more  CORR 2012»
12 years 4 months ago
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdot...
SLP
1989
87views more  SLP 1989»
13 years 10 months ago
Partial Evaluation in Prolog: Some Improvements about Cut
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The analysis about cut is exhaustive: we consider occurrence...
Michele Bugliesi, F. Russo
ICCPOL
2009
Springer
14 years 3 months ago
Dialogue Strategies to Overcome Speech Recognition Errors in Form-Filling Dialogue
Abstract. In a spoken dialogue system, the speech recognition performance accounts for the largest part of the overall system performance. Yet spontaneous speech recognition has an...
Sangwoo Kang, Songwook Lee, Jungyun Seo
NIPS
2003
13 years 10 months ago
Ambiguous Model Learning Made Unambiguous with 1/f Priors
What happens to the optimal interpretation of noisy data when there exists more than one equally plausible interpretation of the data? In a Bayesian model-learning framework the a...
Gurinder S. Atwal, William Bialek