Results 1  10
of
121
Microscopic Evolution of Social Networks
, 2008
"... We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at such a large scale, we study individual node arrival and edge creation processes that collectively lead to macroscopic pr ..."
Abstract

Cited by 206 (10 self)
 Add to MetaCart
local preferential attachment. Based on our observations, we develop a complete model of network evolution, where nodes arrive at a prespecified rate and select their lifetimes. Each node then independently initiates edges according to a “gap” process, selecting a destination for each edge according to a simple
Similarity Searching in Medical Image DataBases
, 1997
"... We propose a method to handle approximate searching by image content in medical image databases. Image content is represented by attributed relational graphs holding features of objects and relationships between objects. The method relies on the assumption that a fixed number of "labeled" ..."
Abstract

Cited by 107 (8 self)
 Add to MetaCart
is approximate so that all images up to a prespecified degree of similarity (tolerance) are retrieved, (b) it has no "false dismissals" (i.e., all images qualifying query selection criteria are retrieved) and (c) it is much faster than sequential scanning for searching in the main memory
Degree Constrained Subgraphs
, 2005
"... In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are prespecified. Further, we use these results to prove a 16edgeweighting version of a conjecture by Karoński, Łuczak and Thomason, an asymptotic 2edgeweighting version of the s ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are prespecified. Further, we use these results to prove a 16edgeweighting version of a conjecture by Karoński, Łuczak and Thomason, an asymptotic 2edgeweighting version
Some Varieties of Qualitative Probability
 Proceedings of the 5th International Conference on Information Processing and the Management of Uncertainty
, 1994
"... In this essay I present a general characterization of qualitative probability, including a partial taxonomy of possible approaches. I discuss some of these in further depth, identify central issues, and suggest some general comparisons. 1. Introduction In the standard theory of probability, degree ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
this theory to the automated derivation of degrees of belief for designated propositions of interest given prespecified degrees of belief over some other propositions and some particular conditioning propositions observed or hypothesized. This approach has, among other advantages, those accruing to a well
Graphs with specified degree distributions, simple epidemics and local vaccination strategies
 ADV. APPL. PROB
, 2007
"... Consider a random graph, having a prespecified degree distribution F but other than that being uniformly distributed, describing the social structure (friendship) in a large community. Suppose one individual in the community is externally infected by an infectious disease and that the disease has ..."
Abstract

Cited by 28 (12 self)
 Add to MetaCart
Consider a random graph, having a prespecified degree distribution F but other than that being uniformly distributed, describing the social structure (friendship) in a large community. Suppose one individual in the community is externally infected by an infectious disease and that the disease has
Loopless Generation of nonregular trees with a prescribed branching sequence, The Computer Journal 53
, 2010
"... An ordered tree is called a nonregular tree with a prescribed branching sequence (or nonregular tree for short) if its internal nodes have a prespecified degree sequence in preorder list. We define a concise representation, called right distance sequences to describe such trees.A coding tree helps ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
An ordered tree is called a nonregular tree with a prescribed branching sequence (or nonregular tree for short) if its internal nodes have a prespecified degree sequence in preorder list. We define a concise representation, called right distance sequences to describe such trees.A coding tree
BoundedDegree Independent Sets in Planar Graphs
 COMPUTING SYSTEMS
, 2005
"... An independent set of a graph is a set of vertices without edges between them. Every planar graph has an independent set of size at least 14 n and there are planar graphs for which any independent set has size at most 14 n. In this paper similar bounds are provided for the problem of boundeddegree ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
independent set, i.e., an independent set where additionally all vertices have degree less than a prespecified bound D. Our upper and lower bounds match (up to a small constant) for D ≤ 16.
doi:10.1093/comjnl/bxp015 Loopless Generation of Nonregular Trees with a Prescribed Branching Sequence1
, 2008
"... An ordered tree is called a nonregular tree with a prescribed branching sequence (or nonregular tree for short) if its internal nodes have a prespecified degree sequence in preorder list. We define a concise representation, called right distance sequences to describe such trees.A coding tree helps ..."
Abstract
 Add to MetaCart
An ordered tree is called a nonregular tree with a prescribed branching sequence (or nonregular tree for short) if its internal nodes have a prespecified degree sequence in preorder list. We define a concise representation, called right distance sequences to describe such trees.A coding tree
Tracking with prescribed transient behaviour for nonlinear systems of known relative degree
 SIAM J. of Control and Optim
, 2007
"... Abstract. Universal tracking control is investigated in the context of a class S of Minput, Moutput dynamical systems modelled by functional differential equations. The class encompasses a wide variety of nonlinear and infinitedimensional systems and contains – as a prototype subclass – all fini ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
of class S, the tracking error e between plant output and reference signal evolves within a prespecified performance envelope or funnel in the sense that ϕ(t)‖e(t) ‖ < 1 for all t ≥ 0, where ϕ a prescribed realvalued function of class W 1, ∞ with the property that ϕ(s)> 0 for all s> 0 and lim
MINIMUMWEIGHT TWOCONNECTED SPANNING NETWORKS
, 1990
"... We consider the problem of constructing a minimumweight, twoconnected network spanning all the points in a set V. We assume a symmetric, nonnegative distance function d ( ' ) defined on V x V which satisfies the triangle inequality. We obtain a structural characterization of optimal solution ..."
Abstract

Cited by 47 (3 self)
 Add to MetaCart
solutions. Specifically, there exists an optimal twoconnected solution whose vertices all have degree 2 or 3, and such that the removal of any edge or pair of edges leaves a bridge in the resulting connected components. These are the strongest possible conditions on the structure of an optimal solution
Results 1  10
of
121