Results 1  10
of
125,028
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
Selection, Routing, and Sorting on the Star Graph
 Proceedings of the International Parallel Processing Symposium
, 1993
"... We consider the problems of selection, routing and sorting on an nstar graph (with n! nodes),an interconnection network which has been proven to possess many special properties. We identify a tree like subgraph (which we call as a ‘(k, 1,k) chain network’) of the star graph which enables us to desi ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We consider the problems of selection, routing and sorting on an nstar graph (with n! nodes),an interconnection network which has been proven to possess many special properties. We identify a tree like subgraph (which we call as a ‘(k, 1,k) chain network’) of the star graph which enables us
Secure Group Communications Using Key Graphs
, 1998
"... Many emerging applications (e.g., teleconference, realtime information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of au ..."
Abstract

Cited by 552 (17 self)
 Add to MetaCart
management. We formalize the notion of a secure group as a triple (U; K;R) where U denotes a set of users, K a set of keys held by the users, and R a userkey relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely
AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULTTOLERANT ROUTING ON THE (n, k)STAR GRAPH∗
, 2014
"... The (n, k)star graph is a generalization of the nstar graph. It has better scalability than the nstar graph and holds some good properties compared with the hypercube. This paper focuses on the design of the faulttolerant routing algorithm for the (n, k)star graph. We adopt the idea of collecti ..."
Abstract
 Add to MetaCart
The (n, k)star graph is a generalization of the nstar graph. It has better scalability than the nstar graph and holds some good properties compared with the hypercube. This paper focuses on the design of the faulttolerant routing algorithm for the (n, k)star graph. We adopt the idea
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
A sentimental education: Sentiment analysis using subjectivity summarization based on minimum cuts
 In Proceedings of the ACL
, 2004
"... Sentiment analysis seeks to identify the viewpoint(s) underlying a text span; an example application is classifying a movie review as “thumbs up” or “thumbs down”. To determine this sentiment polarity, we propose a novel machinelearning method that applies textcategorization techniques to just the ..."
Abstract

Cited by 589 (7 self)
 Add to MetaCart
the subjective portions of the document. Extracting these portions can be implemented using efficient techniques for finding minimum cuts in graphs; this greatly facilitates incorporation of crosssentence contextual constraints. Publication info: Proceedings of the ACL, 2004. 1
The click modular router
, 2001
"... Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network devic ..."
Abstract

Cited by 1155 (28 self)
 Add to MetaCart
devices. A router configuration is a directed graph with elements at the vertices; packets flow along the edges of the graph. Configurations are written in a declarative language that supports userdefined abstractions. This language is both readable by humans and easily manipulated by tools. We present
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Fault Tolerant Routing in the Star and Pancake Interconnection Networks
 Information Processing Letters
"... this paper is to show that a recently proposed interconnection network enjoys similar properties. We will prove that if S n is the nstar graph then for any minimal length routing ae the diameter D(R(S n ; ae)=F ) is at most 3, as long as jF j ! n. Moreover, we will prove that if P n is the npancak ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
this paper is to show that a recently proposed interconnection network enjoys similar properties. We will prove that if S n is the nstar graph then for any minimal length routing ae the diameter D(R(S n ; ae)=F ) is at most 3, as long as jF j ! n. Moreover, we will prove that if P n is the n
Results 1  10
of
125,028