Results 1  10
of
7,901
Weighted Voting for Replicated Data
, 1979
"... In a new algorithm for maintaining replicated data, every copy of a replicated file is assigned some number of votes. Every transaction collects a read quorum of r votes to read a file, and a write quorum of w votes to write a file, such that r+w is greater than the total number number of votes assi ..."
Abstract

Cited by 598 (0 self)
 Add to MetaCart
assigned to the file. This ensures that there is a nonnull intersection between every read quorum and every write quorum. Version numbers make it possible to determine which copies are current. The reliability and performance characteristics of a replicated file can be controlled by appropriately choosing
Sparse coding with an overcomplete basis set: a strategy employed by V1
 Vision Research
, 1997
"... The spatial receptive fields of simple cells in mammalian striate cortex have been reasonably well described physiologically and can be characterized as being localized, oriented, and ban@ass, comparable with the basis functions of wavelet transforms. Previously, we have shown that these receptive f ..."
Abstract

Cited by 958 (9 self)
 Add to MetaCart
is the case when the code is overcompletei.e., when the number of code elements is greater than the effective dimensionality of the input space. Because the basis functions are nonorthogonal and not linearly independent of each other, sparsifying the code will recruit only those basis functions necessary
The SmallWorld Phenomenon: An Algorithmic Perspective
 in Proceedings of the 32nd ACM Symposium on Theory of Computing
, 2000
"... Long a matter of folklore, the “smallworld phenomenon ” — the principle that we are all linked by short chains of acquaintances — was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960’s. This work was among the first to m ..."
Abstract

Cited by 824 (5 self)
 Add to MetaCart
that no decentralized algorithm, operating with local information only, can construct short paths in these networks with nonnegligible probability. We then define an infinite family of network models that naturally generalizes the WattsStrogatz model, and show that for one of these models, there is a decentralized
Binary operations
 Journal of Formalized Mathematics
, 1989
"... Summary. In this paper we define binary and unary operations on domains. We also define the following predicates concerning the operations:... is commutative,... is associative,... is the unity of..., and... is distributive wrt.... A number of schemes useful in justifying the existence of the operat ..."
Abstract

Cited by 363 (6 self)
 Add to MetaCart
〉). In the sequel A is a set. Let A, B be non empty sets, let C be a set, let f be a function from [:A, B:] into C, let a be an element of A, and let b be an element of B. Then f(a, b) is an element of C. The following proposition is true (2) 1 Let A, B, C be non empty sets and f1, f2 be functions from [:A, B
Lexical access during sentence comprehension: (Re)consideration of context effects
 Journal of Verbal Learning and Verbal Behavior
, 1979
"... The effects of prior semantic context upon lexical access during sentence comprehension were examined in two experiments. In both studies, subjects comprehended auditorily presented sentences containing lexical ambiguities and simultaneously performed a lexical decision task upon visually presented ..."
Abstract

Cited by 297 (14 self)
 Add to MetaCart
the integration of information derived from a number of ongoing cognitive processes. It is clear, for example, that semantic and syntactic contexts interact with momenttomoment comprehension processes to affect our interpretation of individual words and sentences; observations that contexts act to determine
The Reflection Theorem
 Journal of Formalized Mathematics
, 1990
"... this paper (and in another Mizar articles) we work in TarskiGrothendieck (TG) theory (see [17]) which ensures the existence of sets that have properties like universal class (i.e. this theory is stronger than MK). The sets are introduced in [15] and some concepts of MK are modeled. The concepts are ..."
Abstract

Cited by 249 (51 self)
 Add to MetaCart
are: the class On of all ordinal numbers belonging to the universe, subclasses, transfinite sequences of nonempty elements of universe, etc. The reflection theorem states that if A ¸ is an increasing and continuous transfinite sequence of nonempty sets and class A =
A Tutorial on (Co)Algebras and (Co)Induction
 EATCS Bulletin
, 1997
"... . Algebraic structures which are generated by a collection of constructors like natural numbers (generated by a zero and a successor) or finite lists and trees are of wellestablished importance in computer science. Formally, they are initial algebras. Induction is used both as a definition pr ..."
Abstract

Cited by 271 (36 self)
 Add to MetaCart
. Algebraic structures which are generated by a collection of constructors like natural numbers (generated by a zero and a successor) or finite lists and trees are of wellestablished importance in computer science. Formally, they are initial algebras. Induction is used both as a definition
Trigonometric Form of Complex Numbers MML Identifier: COMPTRIG.
"... The scheme Regr without 0 concerns a unary predicate P, and states that: P [1] provided the parameters meet the following requirements: • There exists a non empty natural number k such that P [k], and • For every non empty natural number k such that k � = 1 and P [k] there exists a non empty natural ..."
Abstract
 Add to MetaCart
The scheme Regr without 0 concerns a unary predicate P, and states that: P [1] provided the parameters meet the following requirements: • There exists a non empty natural number k such that P [k], and • For every non empty natural number k such that k � = 1 and P [k] there exists a non empty
AnchorPROMPT: Using NonLocal Context for Semantic Matching
 IN PROCEEDINGS OF THE WORKSHOP ON ONTOLOGIES AND INFORMATION SHARING AT THE INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI
, 2001
"... Researchers in the ontologydesign field have developed the content for ontologies in many domain areas. Recently, ontologies have become increasingly common on the WorldWide Web where they provide semantics for annotations in Web pages. This distributed nature of ontology development has led t ..."
Abstract

Cited by 182 (8 self)
 Add to MetaCart
Researchers in the ontologydesign field have developed the content for ontologies in many domain areas. Recently, ontologies have become increasingly common on the WorldWide Web where they provide semantics for annotations in Web pages. This distributed nature of ontology development has led
Probabilistic Independent Component Analysis
, 2003
"... Independent Component Analysis is becoming a popular exploratory method for analysing complex data such as that from FMRI experiments. The application of such 'modelfree' methods, however, has been somewhat restricted both by the view that results can be uninterpretable and by the lack of ..."
Abstract

Cited by 208 (13 self)
 Add to MetaCart
of the data, i.e. the number of activation and nonGaussian noise sources. Reduction of the data to this 'true' subspace before the ICA decomposition automatically results in an estimate of the noise, leading to the ability to assign significance to voxels in ICA spatial maps. Estimation
Results 1  10
of
7,901