Sciweavers

208 search results - page 20 / 42
» A Normal Form for Function Rings of Piecewise Functions
Sort
View
ACL
1998
13 years 9 months ago
Deriving the Predicate-Argument Structure for a Free Word Order Language
In relatively free word order languages, grammatical functions are intricately related to case marking. Assuming an ordered representation of the predicate-argument structure, thi...
Cem H. Bozsahin
HASKELL
2006
ACM
14 years 1 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
IANDC
2006
102views more  IANDC 2006»
13 years 7 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
CEC
2007
IEEE
13 years 9 months ago
Multi-population approach to approximate the development of neocortical networks
— Cultured natural cortical neurons form functional networks through a complex set of developmental steps during the first weeks in vitro. The dynamic behavior of the network in...
Andreas Herzog, Karsten Kube, Bernd Michaelis, Ana...
ICFP
2009
ACM
14 years 8 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak