Results 1  10
of
601,624
PARALLELOGRAMFREE DISTANCEREGULAR GRAPHS
"... Abstract. Let Γ = (X, R) denote a distanceregular graph with distance function ∂ and diameter d ≥ 4. By a parallelogram of length i (2 ≤ i ≤ d), we mean a 4tuple xyzu of vertices in X such that ∂(x, y) = ∂(z, u) = 1, ∂(x, u) = i, and ∂(x, z) = ∂(y, z) = ∂(y, u) = i − 1. We prove the followin ..."
Abstract
 Add to MetaCart
) Γ is bipartite. (iib) Γ is a generalized odd graph. (iic) Γ has classical parameters (d, b, α, β) and either b < −1 or Γ is a Hamming graph or a dual polar graph. 1. Introduction. It is well known that a distanceregular graph with classical parameters has the
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
DistanceRegular Cayley Graphs on . . .
"... The main result of this article is a classification of distanceregular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1factor removed, ..."
Abstract
 Add to MetaCart
The main result of this article is a classification of distanceregular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1factor removed
DistanceRegular Cayley Graphs
, 2006
"... This paper is a survey of distanceregular Cayley graphs of diameter two and three, primarily focusing on diameter three (due to the extensive amount of research already done in diameter two). The graphs were classified by their properties and related eigenvalues and multiplicities. Each classificat ..."
Abstract
 Add to MetaCart
This paper is a survey of distanceregular Cayley graphs of diameter two and three, primarily focusing on diameter three (due to the extensive amount of research already done in diameter two). The graphs were classified by their properties and related eigenvalues and multiplicities. Each
"GrabCut”  interactive foreground extraction using iterated graph cuts
 ACM TRANS. GRAPH
, 2004
"... The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently ..."
Abstract

Cited by 1140 (36 self)
 Add to MetaCart
. Recently, an approach based on optimization by graphcut has been developed which successfully combines both types of information. In this paper we extend the graphcut approach in three respects. First, we have developed a more powerful, iterative version of the optimisation. Secondly, the power
The program dependence graph and its use in optimization
 ACM Transactions on Programming Languages and Systems
, 1987
"... In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. ..."
Abstract

Cited by 989 (3 self)
 Add to MetaCart
In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
 MACHINE LEARNING
, 1999
"... Methods for voting classification algorithms, such as Bagging and AdaBoost, have been shown to be very successful in improving the accuracy of certain classifiers for artificial and realworld datasets. We review these algorithms and describe a large empirical study comparing several variants in co ..."
Abstract

Cited by 695 (2 self)
 Add to MetaCart
Methods for voting classification algorithms, such as Bagging and AdaBoost, have been shown to be very successful in improving the accuracy of certain classifiers for artificial and realworld datasets. We review these algorithms and describe a large empirical study comparing several variants
Automatic Musical Genre Classification Of Audio Signals
 IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING
, 2002
"... ... describe music. They are commonly used to structure the increasing amounts of music available in digital form on the Web and are important for music information retrieval. Genre categorization for audio has traditionally been performed manually. A particular musical genre is characterized by sta ..."
Abstract

Cited by 811 (32 self)
 Add to MetaCart
set of features for representing rhythmic structure and strength is proposed. The performance of those feature sets has been evaluated by training statistical pattern recognition classifiers using real world audio collections. Based on the automatic hierarchical genre classification two graphical user
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
, 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 534 (48 self)
 Add to MetaCart
, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should
Results 1  10
of
601,624