Compact Representations of Extended Causal Models
نویسندگان
چکیده
منابع مشابه
Compact Representations of Extended Causal Models
Judea Pearl (2000) was the first to propose a definition of actual causation using causal models. A number of authors have suggested that an adequate account of actual causation must appeal not only to causal structure but also to considerations of normality. In Halpern and Hitchcock (2011), we offer a definition of actual causation using extended causal models, which include information about ...
متن کاملExtended Compact Web Graph Representations
Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within main memory. These representations at least provide fast navigation (to the neighbors of a node), yet more sophisticated operations are desirable for several Web analyses. We present a compact Web graph representation that, in a...
متن کاملCompact Representations of Word Location Independence in Connectionist Models
We studied representations built in Cascade-Correlation (Cascor) connectionist models, using a modified encoder task in which networks learn to reproduce fourletter strings of characters and words in a locationindependent fashion. We found that Cascor successfully encodes input patterns onto a smaller set of hidden units. Cascor learned simultaneously regularities related to word structure (“wo...
متن کاملObservables in Extended Percolation Models of Causal Set Cosmology
Classical sequential growth models for causal sets provide an important step towards the formulation of a quantum causal set dynamics. The covariant observables in a class of these models known as generalised percolation have been completely characterised in terms of physically well-defined “stem sets” and yield an insight into the nature of observables in quantum causal set cosmology. We discu...
متن کاملCompact Representations of Cuts
Consider the ( n 2 ) (or O(n2)) min-cut problems on a graph with n nodes and nonnegative edge weights. Gomory and Hu [J. Soc. Indust. Appl. Math., 9 (1961), pp. 551–570] showed (essentially) that there are at most n−1 different min-cuts. They also described a compact structure (the flow equivalent tree) of size O(n) with the following property: for any pair of nodes, the value of a min-cut can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cognitive Science
سال: 2013
ISSN: 0364-0213
DOI: 10.1111/cogs.12059