Results 1  10
of
17,625
Randomness Conductors and ConstantDegree LosslessExpanders
"... ABSTRACT The main concrete result of this paper is the first explicit construction of constant degree lossless expanders. In these graphs, the expansion factor is almost as large as possible: (1 s^)D, where D is the degree and s ^ is an arbitrarily small constant. The best previous explicit constru ..."
Abstract
 Add to MetaCart
ABSTRACT The main concrete result of this paper is the first explicit construction of constant degree lossless expanders. In these graphs, the expansion factor is almost as large as possible: (1 s^)D, where D is the degree and s ^ is an arbitrarily small constant. The best previous explicit
Fusion, Propagation, and Structuring in Belief Networks
 ARTIFICIAL INTELLIGENCE
, 1986
"... Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to repre ..."
Abstract

Cited by 482 (8 self)
 Add to MetaCart
Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to represent the generic knowledge of a domain expert, and it turns into a computational architecture if the links are used not merely for storing factual knowledge but also for directing and activating the data flow in the computations which manipulate this knowledge. The first part of the paper deals with the task of fusing and propagating the impacts of new information through the networks in such a way that, when equilibrium is reached, each proposition will be assigned a measure of belief consistent with the axioms of probability theory. It is shown that if the network is singly connected (e.g. treestructured), then probabilities can be updated by local propagation in an isomorphic network of parallel and autonomous processors and that the impact of new information can be imparted to all propositions in time proportional to the longest path in the network. The second part of the paper deals with the problem of finding a treestructured representation for a collection of probabilistically coupled propositions using auxiliary (dummy) variables, colloquially called "hidden causes. " It is shown that if such a treestructured representation exists, then it is possible to uniquely uncover the topology of the tree by observing pairwise dependencies among the available propositions (i.e., the leaves of the tree). The entire tree structure, including the strengths of all internal relationships, can be reconstructed in time proportional to n log n, where n is the number of leaves.
The Hero with a Thousand Faces
, 1972
"... Botiingen Foundation, andpttt.!.,.: b % / ,.,;:,c,m B<,.ik.*, second ..."
Abstract

Cited by 353 (0 self)
 Add to MetaCart
Botiingen Foundation, andpttt.!.,.: b % / ,.,;:,c,m B<,.ik.*, second
Shortlist: a connectionist model of continuous speech recognition
 Cognition
, 1994
"... Previous work has shown how a backpropagation network with recurrent connections can successfully model many aspects of human spoken word recognition (Norris, 1988, 1990, 1992, 1993). However, such networks are unable to revise their decisions in the light of subsequent context. TRACE (McClelland ..."
Abstract

Cited by 312 (14 self)
 Add to MetaCart
Previous work has shown how a backpropagation network with recurrent connections can successfully model many aspects of human spoken word recognition (Norris, 1988, 1990, 1992, 1993). However, such networks are unable to revise their decisions in the light of subsequent context. TRACE (McClelland & Elman, 1986), on the other hand, manages to deal appropriately with following context, but only by using a highly implausible architecture that fails to account for some important experimental results. A new model is presented which displays the more desirable properties of each of these models. In contrast to TRACE the new model is entirely bottomup and can readily perform simulations with vocabularies of tens of thousands of words. 1.
Compositional Modeling: Finding the Right Model for the Job
, 1991
"... Faikenhainer, B. and K.D. Forbus, Compositional modeling: finding the right model for the job, Artificial Intelligence 51 ( 1991 ) 95143. ..."
Abstract

Cited by 271 (28 self)
 Add to MetaCart
Faikenhainer, B. and K.D. Forbus, Compositional modeling: finding the right model for the job, Artificial Intelligence 51 ( 1991 ) 95143.
The Technological Society
, 1964
"... A penetrating analysis of our technical civilization and of the effect of an increasingly standardized culture on the future of man ..."
Abstract

Cited by 259 (1 self)
 Add to MetaCart
A penetrating analysis of our technical civilization and of the effect of an increasingly standardized culture on the future of man
Capacity Achieving Codes From Randomness Conductors
, 901
"... Abstractâ€”We give a general framework for construction of small ensembles of capacity achieving linear codes for a wide range of (not necessarily memoryless) discrete symmetric channels, and in particular, the binary erasure and symmetric channels. The main tool used in our constructions is the notio ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
is the notion of randomness extractors and lossless condensers that are regarded as central tools in theoretical computer science. Same as random codes, the resulting ensembles preserve their capacity achieving properties under any change of basis. Our methods can potentially lead to polynomialsized ensembles
A pointcharge force field for molecular mechanics simulations of proteins based on condensedphase QM calculations
 J. Comput. Chem
, 2003
"... Abstract: Molecular mechanics models have been applied extensively to study the dynamics of proteins and nucleic acids. Here we report the development of a thirdgeneration pointcharge allatom force field for proteins. Following the earlier approach of Cornell et al., the charge set was obtained b ..."
Abstract

Cited by 223 (6 self)
 Add to MetaCart
mechanical methods. All other parameters were taken from the existing AMBER data base. The major departure from previous force fields is that all quantum mechanical calculations were done in the condensed phase with continuum solvent models and an effective dielectric constant of 4. We anticipate
Building Secure and Reliable Network Applications
, 1996
"... ly, the remote procedure call problem, which an RPC protocol undertakes to solve, consists of emulating LPC using message passing. LPC has a number of "properties"  a single procedure invocation results in exactly one execution of the procedure body, the result returned is reliably deliv ..."
Abstract

Cited by 232 (16 self)
 Add to MetaCart
ly, the remote procedure call problem, which an RPC protocol undertakes to solve, consists of emulating LPC using message passing. LPC has a number of "properties"  a single procedure invocation results in exactly one execution of the procedure body, the result returned is reliably delivered to the invoker, and exceptions are raised if (and only if) an error occurs. Given a completely reliable communication environment, which never loses, duplicates, or reorders messages, and given client and server processes that never fail, RPC would be trivial to solve. The sender would merely package the invocation into one or more messages, and transmit these to the server. The server would unpack the data into local variables, perform the desired operation, and send back the result (or an indication of any exception that occurred) in a reply message. The challenge, then, is created by failures. Were it not for the possibility of process and machine crashes, an RPC protocol capable of overcomi...
Results 1  10
of
17,625