Results 1  10
of
635,559
Moduli Of Sheaves On BlownUp Surfaces
"... This paper is a joint work with K. Yoshioka in Kobe University. Let p : b X ! X be the blowup of a nonsingular complex projective surface X at a point P 2 X and C the exceptional divisor on b X. In this paper, we study relations between moduli spaces of coherent torsionfree sheaves on X and b X ..."
Abstract
 Add to MetaCart
This paper is a joint work with K. Yoshioka in Kobe University. Let p : b X ! X be the blowup of a nonsingular complex projective surface X at a point P 2 X and C the exceptional divisor on b X. In this paper, we study relations between moduli spaces of coherent torsionfree sheaves on X and b
MODULI OF SHEAVES ON BLOWNUP SURFACES
"... This paper is ajoint work with K. Yoshioka in Kobe University. Let $p:\hat{X}arrow X $ be the blowup of anonsingular complex projective surface $X $ at apoint $P\in X $ and $C $ the exceptional divisor on $\hat{X} $. In this paper, we study relations between moduli spaces of coherent torsionfree s ..."
Abstract
 Add to MetaCart
This paper is ajoint work with K. Yoshioka in Kobe University. Let $p:\hat{X}arrow X $ be the blowup of anonsingular complex projective surface $X $ at apoint $P\in X $ and $C $ the exceptional divisor on $\hat{X} $. In this paper, we study relations between moduli spaces of coherent torsion
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
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized
Interprocedural Slicing Using Dependence Graphs
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1990
"... ... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previou ..."
Abstract

Cited by 822 (85 self)
 Add to MetaCart
... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends
Indivisible labor and the business cycle
 Journal of Monetary Economics
, 1985
"... A growth model with shocks to technology is studied. Labor is indivisible, so all variability in hours worked is due to fluctuations in the number employed. We find that, unlike previous equilibrium models of the business cycle, this economy displays large fluctuations in hours worked and relatively ..."
Abstract

Cited by 793 (10 self)
 Add to MetaCart
A growth model with shocks to technology is studied. Labor is indivisible, so all variability in hours worked is due to fluctuations in the number employed. We find that, unlike previous equilibrium models of the business cycle, this economy displays large fluctuations in hours worked
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 712 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
Results 1  10
of
635,559