Results 1  10
of
859,749
Graph Construction
"... Abstract. Graphbased semisupervised learning (SSL) methods usually consist of two stages: in the first stage, a graph is constructed from the set of input instances; and in the second stage, the available label information along with the constructed graph is used to assign labels to the unlabeled ..."
Abstract
 Add to MetaCart
Abstract. Graphbased semisupervised learning (SSL) methods usually consist of two stages: in the first stage, a graph is constructed from the set of input instances; and in the second stage, the available label information along with the constructed graph is used to assign labels to the unlabeled
Construction of abstract state graphs with PVS
, 1997
"... We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a reasonab ..."
Abstract

Cited by 748 (10 self)
 Add to MetaCart
We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a
Degreebased graph construction
, 905
"... Abstract. Degreebased graph construction is an ubiquitous problem in network modeling [1, 2], ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects t ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Abstract. Degreebased graph construction is an ubiquitous problem in network modeling [1, 2], ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects
Graph Constructions and Transfer Maps
"... This paper is expository and an outgrowth of two talks which I gave at Nagoya in Japan 2007 and at Hunan in China 2006. B.Man, E.Miller and H.Miller defined “graph construction”, which was a variant of a construction of Becker and Schultz. In this paper we generalize the graph constructions and show ..."
Abstract
 Add to MetaCart
This paper is expository and an outgrowth of two talks which I gave at Nagoya in Japan 2007 and at Hunan in China 2006. B.Man, E.Miller and H.Miller defined “graph construction”, which was a variant of a construction of Becker and Schultz. In this paper we generalize the graph constructions
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α
What energy functions can be minimized via graph cuts?
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2004
"... In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are co ..."
Abstract

Cited by 1047 (23 self)
 Add to MetaCart
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions
A framework for call graph construction algorithms
 ACM Transactions on Programming Languages and Systems
, 2001
"... A large number of call graph construction algorithms for objectoriented and functional languages have been proposed, each embodying different tradeoffs between analysis cost and call graph precision. In this article we present a unifying framework for understanding call graph construction algorithm ..."
Abstract

Cited by 93 (2 self)
 Add to MetaCart
A large number of call graph construction algorithms for objectoriented and functional languages have been proposed, each embodying different tradeoffs between analysis cost and call graph precision. In this article we present a unifying framework for understanding call graph construction
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
Results 1  10
of
859,749