Sciweavers

1003 search results - page 95 / 201
» Type Inference with Inequalities
Sort
View
HASKELL
2006
ACM
15 years 10 months ago
Polymorphic variants in Haskell
In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants are potenti...
Koji Kagawa
SAS
2004
Springer
134views Formal Methods» more  SAS 2004»
15 years 9 months ago
Towards Declarative Programming for Web Services
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
Sheila A. McIlraith
ALDT
2011
Springer
262views Algorithms» more  ALDT 2011»
14 years 4 months ago
Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach
Abstract. We develop a Bayesian approach to concept learning for crowdsourcing applications. A probabilistic belief over possible concept definitions is maintained and updated acc...
Paolo Viappiani, Sandra Zilles, Howard J. Hamilton...
131
Voted
ALT
2004
Springer
16 years 1 months ago
Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space
Different formal learning models address different aspects of learning. Below we compare learning via queries—interpreting learning as a one-shot process in which the learner i...
Steffen Lange, Sandra Zilles
FOCS
2005
IEEE
15 years 9 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...