Results 1  10
of
188,465
Retiming Synchronous Circuitry
 ALGORITHMICA
, 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract

Cited by 374 (3 self)
 Add to MetaCart
circuit into a more efficient circuit under a variety of different cost criteria. We model a circuit as a graph in which the vertex set Visa collection of combinational logic elements and the edge set E is the set of interconnections, each of which may pass through zero or more registers. We give an 0(V
Approximating the permanent
 SIAM J. Computing
, 1989
"... Abstract. A randomised approximation scheme for the permanent of a 01 matrix is presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter is accomplished by simulating a Markov chain whose states are the matchings in the ..."
Abstract

Cited by 344 (26 self)
 Add to MetaCart
matrices in some reasonable probabilistic model for 01 matrices of given density. For the approach sketched above to be computationally efficient, the Markov chain must be rapidly mixing: informally, it must converge in a short time to its stationary distribution. A major portion of the paper is devoted
Random graph models of social networks
"... We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predic ..."
Abstract

Cited by 247 (1 self)
 Add to MetaCart
We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare
The NPcompleteness column: an ongoing guide
 JOURNAL OF ALGORITHMS
, 1987
"... This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freem ..."
Abstract

Cited by 239 (0 self)
 Add to MetaCart
This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H
Dissociative Adsorption: A Solvable Model
, 1993
"... Abstract: A model of “hot”dimer deposition in one dimension, introduced by Pereyra and Albano, is modified to have an unbounded dissociation range. The resulting dynamical equations are solved exactly. A related kmer dissociation model is also introduced and its solution obtained as a quadrature. ..."
Abstract
 Add to MetaCart
Abstract: A model of “hot”dimer deposition in one dimension, introduced by Pereyra and Albano, is modified to have an unbounded dissociation range. The resulting dynamical equations are solved exactly. A related kmer dissociation model is also introduced and its solution obtained as a quadrature
The DroshaDGCR8 complex in primary microRNA processing
 Genes Dev
, 2004
"... RNase III proteins play key roles in microRNA (miRNA) biogenesis. The nuclear RNase III Drosha cleaves primary miRNAs (primiRNAs) to release hairpinshaped premiRNAs that are subsequently cut by the cytoplasmic RNase III Dicer to generate mature miRNAs. While Dicer (class III) and other simple RNa ..."
Abstract

Cited by 218 (4 self)
 Add to MetaCart
to be similar to that of human Dicer; the RNase III domains A and B form an intramolecular dimer and cleave the 3 and 5 strands of the stem, respectively. Human Drosha fractionates at ∼650 kDa, indicating that Drosha functions as a large complex. In this complex, Drosha interacts with DGCR8, which contains
Functional relations in solvable lattice models. I. Functional relations and representation theory
 Internat. J. Modern Phys. A
, 1994
"... Abstract. Reported are two applications of the functional relations (Tsystem) among a commuting family of rowtorow transfer matrices proposed in the previous paper Part I. For a general simple Lie algebra Xr, we determine the correlation lengths of the associated massive vertex models in the anti ..."
Abstract

Cited by 123 (11 self)
 Add to MetaCart
Abstract. Reported are two applications of the functional relations (Tsystem) among a commuting family of rowtorow transfer matrices proposed in the previous paper Part I. For a general simple Lie algebra Xr, we determine the correlation lengths of the associated massive vertex models
Diffraction of Random Tilings: Some Rigorous Results
 J. STAT. PHYS
, 1999
"... The diffraction of stochastic point sets, both Bernoulli and Markov, and of random tilings with crystallographic symmetries is investigated in rigorous terms. In particular, we derive the diffraction spectrum of 1D random tilings, of stochastic product tilings built from cuboids, and of planar rando ..."
Abstract

Cited by 29 (17 self)
 Add to MetaCart
random tilings based on solvable dimer models, augmented by a brief outline of the diraction from the classical 2D Ising lattice gas. We also give a summary of the measure theoretic approach to mathematical diraction theory which underlies the unique decomposition of the diffraction spectrum into its
Results 1  10
of
188,465