412 search results - page 64 / 83 » Bootstrapping Rule Induction |
CCS
2011
ACM
12 years 10 months ago
2011
ACM
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable e...
KDD
2004
ACM
14 years 10 months ago
2004
ACM
We present a case study about the application of the inductive database approach to the analysis of Web logs. We consider rich XML Web logs ? called conceptual logs ? that are gen...
ISCAS
2002
IEEE
14 years 3 months ago
2002
IEEE
We have implemented an aspect of learning and memory in the nervous system using analog electronics. Using a simple synaptic circuit we realize networks with Hebbian type adaptati...
TLCA
1997
Springer
14 years 2 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
TPHOL
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...