Results 1  10
of
307,542
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
Clawfree graphs IV. Decomposition theorem
 J. COMBINATORIAL THEORY, SER. B
, 2003
"... A graph is clawfree if no vertex has three pairwise nonadjacent neighbours. In this series of papers we give a structural description of all clawfree graphs. In this paper, we achieve a major part of that goal; we prove that every clawfree graph either belongs to one of a few basic classes, or ad ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
A graph is clawfree if no vertex has three pairwise nonadjacent neighbours. In this series of papers we give a structural description of all clawfree graphs. In this paper, we achieve a major part of that goal; we prove that every clawfree graph either belongs to one of a few basic classes
Design and Evaluation of a WideArea Event Notification Service
 ACM Transactions on Computer Systems
"... This paper presents SIENA, an event notification service that we have designed and implemented to exhibit both expressiveness and scalability. We describe the service's interface to applications, the algorithms used by networks of servers to select and deliver event notifications, and the strat ..."
Abstract

Cited by 789 (32 self)
 Add to MetaCart
, and the strategies used Effort sponsored by the Defense Advanced Research Projects Agency, and Air Force Research Laboratory, Air Force Materiel Command,USAF, under agreement numbers F3060294C0253, F3060297 20021, F306029820163, F3060299C0174, F306020020608, and N66001008945; by the Air Force Office
Planarization and acyclic colorings of subcubic clawfree graphs
"... Abstract. We study methods of planarizing and acyclically coloring clawfree subcubic graphs. We give a polynomialtime algorithm that, given such a graph G, produces an independent set Q of at most n/6 vertices whose removal from G leaves an induced planar subgraph P (in fact, P has treewidth at mo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
knowledge, this represents the largest known subclass of subcubic graphs such that an optimal acyclic vertex coloring can be found in polynomialtime. We show that this bound is tight by proving that the problem is NPhard for cubic line graphs (and therefore, clawfree graphs) of maximum degree d ≥ 4
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
as random graphs, it is increasingly recognized that the topology and evolution of real
The Impact of Trade on IntraIndustry Reallocations and Aggregate Industry Productivity
, 2002
"... This paper builds a dynamic industry model with heterogeneous firms that exhibits the mechanisms by which trade causes reallocations of resources among firms in an industry. The paper shows how the exposure to trade will induce only the more productive firms to enter the export market (while some le ..."
Abstract

Cited by 1538 (24 self)
 Add to MetaCart
less productive firms continue to produce only for the domestic market) and will simultaneously force the least productive firms to exit. It then shows how further increases in the industry’s exposure to trade (driven by trade liberalization or the addition of new trading partners) lead to additional
Experiments with a New Boosting Algorithm
, 1996
"... In an earlier paper, we introduced a new “boosting” algorithm called AdaBoost which, theoretically, can be used to significantly reduce the error of any learning algorithm that consistently generates classifiers whose performance is a little better than random guessing. We also introduced the relate ..."
Abstract

Cited by 2176 (21 self)
 Add to MetaCart
the related notion of a “pseudoloss ” which is a method for forcing a learning algorithm of multilabel conceptsto concentrate on the labels that are hardest to discriminate. In this paper, we describe experiments we carried out to assess how well AdaBoost with and without pseudoloss, performs on real
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques
Results 1  10
of
307,542