Sciweavers

462 search results - page 30 / 93
» Function Types in Complete Type Inference
Sort
View
TCS
1998
13 years 7 months ago
Axiomatisation of Functional Dependencies in Incomplete Relations
Incomplete relations are relations which contain null values, whose meaning is \value is at present unknown". Such relations give rise to two types of functional dependency (...
Mark Levene, George Loizou
SP
2008
IEEE
159views Security Privacy» more  SP 2008»
13 years 7 months ago
Inferring neuronal network connectivity from spike data: A temporal data mining approach
Abstract. Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology an...
Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishn...
JSC
2002
84views more  JSC 2002»
13 years 7 months ago
A Constructive Algebraic Hierarchy in Coq
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof ...
Herman Geuvers, Randy Pollack, Freek Wiedijk, Jan ...
GOSLER
1995
13 years 11 months ago
Learning and Consistency
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
Rolf Wiehagen, Thomas Zeugmann
ASIAN
1999
Springer
114views Algorithms» more  ASIAN 1999»
13 years 12 months ago
Entailment of Non-structural Subtype Constraints
Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to...
Joachim Niehren, Tim Priesnitz