Sciweavers

2373 search results - page 39 / 475
» On the Theory of Structural Subtyping
Sort
View
BIRTHDAY
2003
Springer
15 years 2 months ago
Towards a Brain Compatible Theory of Syntax Based on Local Testability
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
Stefano Crespi-Reghizzi, Valentino Braitenberg
ISMIS
2003
Springer
15 years 2 months ago
Granular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
Y. Y. Yao, Churn-Jung Liau, Ning Zhong
CIE
2007
Springer
15 years 3 months ago
Locally Computable Structures
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
Russell G. Miller
EOR
2010
88views more  EOR 2010»
14 years 9 months ago
Monge extensions of cooperation and communication structures
Cooperation structures without any a priori assumptions on the combinatorial structure of feasible coalitions are studied and a general theory for marginal values, cores and conve...
Ulrich Faigle, Michel Grabisch, M. Heyne
BMCBI
2010
86views more  BMCBI 2010»
14 years 9 months ago
Protein binding hot spots and the residue-residue pairing preference: a water exclusion perspective
Background: A protein binding hot spot is a small cluster of residues tightly packed at the center of the interface between two interacting proteins. Though a hot spot constitutes...
Qian Liu, Jinyan Li