Sciweavers

327 search results - page 37 / 66
» On the structure of the Medvedev lattice
Sort
View
JMLR
2010
134views more  JMLR 2010»
14 years 7 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
107
Voted
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 1 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
87
Voted
IFIP
2005
Springer
15 years 6 months ago
Relative Trustworthiness
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
Johan W. Klüwer, Arild Waaler
99
Voted
ACRI
2004
Springer
15 years 6 months ago
Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics
Abstract. We outline the basic principles of neuropercolation, a generalized percolation model motivated by the dynamical properties of the neuropil, the densely interconnected neu...
Robert Kozma, Marko Puljic, Paul Balister, B&eacut...
84
Voted
RSCTC
1998
Springer
129views Fuzzy Logic» more  RSCTC 1998»
15 years 4 months ago
On Generalizing Pawlak Approximation Operators
This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and pos...
Y. Y. Yao