Results 1  10
of
193,138
Random Graphs and the Parity Quantifier
, 2009
"... The classical zeroone law for firstorder logic on random graphs says that for every firstorder property ϕ in the theory of graphs and every p ∈ (0, 1), the probability that the random graph G(n, p) satisfies ϕ approaches either 0 or 1 as n approaches infinity. It is well known that this law fails ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
infinity, the probability that the random graph G(2n + i, p) satisfies ϕ approaches ai. Our results also extend appropriately to FO equipped with Modq quantifiers for prime q.
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
A quantitative comparison of graphbased models for internet topology
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... Graphs are commonly used to model the topological structure of internetworks, to study problems ranging from routing to resource reservation. A variety of graphs are found in the literature, including fixed topologies such as rings or stars, "wellknown" topologies such as the ARPAnet, and ..."
Abstract

Cited by 266 (3 self)
 Add to MetaCart
, and randomly generated topologies. While many researchers rely upon graphs for analytic and simulation studies, there has been little analysis of the implications of using a particular model, or how the graph generation method may a ect the results of such studies. Further, the selection of one generation
Latent Space Approaches to Social Network Analysis
 JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
, 2001
"... Network models are widely used to represent relational information among interacting units. In studies of social networks, recent emphasis has been placed on random graph models where the nodes usually represent individual social actors and the edges represent the presence of a specified relation be ..."
Abstract

Cited by 308 (19 self)
 Add to MetaCart
Network models are widely used to represent relational information among interacting units. In studies of social networks, recent emphasis has been placed on random graph models where the nodes usually represent individual social actors and the edges represent the presence of a specified relation
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Efficient Testing of Large Graphs
 Combinatorica
"... Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case that it h ..."
Abstract

Cited by 176 (47 self)
 Add to MetaCart
Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case
Degree Lower Bounds of TowerType for Approximating Formulas with Parity Quantifiers
, 2012
"... Kolaitis and Kopparty have shown that for any firstorder formula with parity quantifiers over the language of graphs there is a family of multivariate polynomials of constantdegree that agree with the formula on all but afraction of the graphs with vertices. The proof yields a bound on the degre ..."
Abstract
 Add to MetaCart
Kolaitis and Kopparty have shown that for any firstorder formula with parity quantifiers over the language of graphs there is a family of multivariate polynomials of constantdegree that agree with the formula on all but afraction of the graphs with vertices. The proof yields a bound
Parity Approach
, 2008
"... An electronic version of the paper may be downloaded • from the SSRN website: www.SSRN.com • from the RePEc website: www.RePEc.org • from the CESifo website: Twww.CESifogroup.org/wp T ..."
Abstract
 Add to MetaCart
An electronic version of the paper may be downloaded • from the SSRN website: www.SSRN.com • from the RePEc website: www.RePEc.org • from the CESifo website: Twww.CESifogroup.org/wp T
Quantifying
"... immunogold localization on electron microscopic thin sections: a compendium of new approaches for plant cell biologists ..."
Abstract
 Add to MetaCart
immunogold localization on electron microscopic thin sections: a compendium of new approaches for plant cell biologists
Results 1  10
of
193,138