Results 1  10
of
199
ODD MINIMUM CUT SETS AND bMATCHINGS REVISITED
, 2006
"... The famous Padberg–Rao separation algorithm for bmatching polyhedra can be implemented to run in O(V  2 Elog(V  2 /E)) time in the uncapacitated case, and in O(V E  2 log(V  2 /E)) time in the capacitated case. We give a new and simple algorithm for the capacitated case which can b ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
The famous Padberg–Rao separation algorithm for bmatching polyhedra can be implemented to run in O(V  2 Elog(V  2 /E)) time in the uncapacitated case, and in O(V E  2 log(V  2 /E)) time in the capacitated case. We give a new and simple algorithm for the capacitated case which can
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
centrality measure by dividing by the maximum possible degree in an nactor network (i.e., n1). While we normalize the centrality measures used in the empirical analysis, we note that all our results are robust to using nonnormalized network centrality measures instead. 8 B. Closeness While degree counts
Recognition of Occluded Polyhedra from Range Images
 Quaderni di Semantica
, 2000
"... Occlusion remains a major hindrance for automatic recognition of 3D objects. In this paper, we address the occlusion problem in the context of polyhedral object recognition from range data. A novel approach is presented for object recognition based on sound occlusionguided reasoning for feature di ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
distortion analysis and perceptual organization. This type of reasoning enables us to maximize the amount of information extracted from the scene data, thus leading to robust and efficient recognition. The proposed approach is based on a multistage matching process, which attempts to recognize scene objects
Improving the rate of convergence of ‘high order finite elements’ on polyhedra II: Mesh refinements and interpolation
 NUMERISCHE MATEMATHIK
, 2006
"... Given a bounded polyhedral domain Ω ⊂ R3, we construct a sequence of tetrahedralizations (i.e., meshes) T ′ k that provides quasioptimal rates of convergence with respect to the dimension of the aproximation space for the Poisson problem with data f ∈ Hm−1 (Ω), m ≥ 2. More precisely, let Sk be the ..."
Abstract

Cited by 38 (28 self)
 Add to MetaCart
Given a bounded polyhedral domain Ω ⊂ R3, we construct a sequence of tetrahedralizations (i.e., meshes) T ′ k that provides quasioptimal rates of convergence with respect to the dimension of the aproximation space for the Poisson problem with data f ∈ Hm−1 (Ω), m ≥ 2. More precisely, let Sk
Nonuniqueness phase of Bernoulli percolation on reflection groups for some polyhedra in H3
, 2014
"... In the present paper I consider Cayley graphs of reflection groups of finitesided Coxeter polyhedra in 3dimensional hyperbolic space H3, with standard sets of generators. As the main result, I prove the existence of nontrivial nonuniqueness phase of bond and site Bernoulli percolation on such gr ..."
Abstract
 Add to MetaCart
.2) and an upper bound for the growth rate of the sequence ( # {simple cycles of length n through o})n for a regular graph of degree ≥ 2 with a distinguished vertex o, depending on its spectral radius (see thm. 5.1 and rem. 2.3), both used to prove the main result. 1
See What You Want to See: Motivational Influences on Visual Perception,”
 Journal of Personality and Social Psychology,
, 2006
"... People's motivational statestheir wishes and preferencesinfluence their processing of visual stimuli. In 5 studies, participants shown an ambiguous figure (e.g., one that could be seen either as the letter B or the number 13) tended to report seeing the interpretation that assigned them to o ..."
Abstract

Cited by 79 (1 self)
 Add to MetaCart
People's motivational statestheir wishes and preferencesinfluence their processing of visual stimuli. In 5 studies, participants shown an ambiguous figure (e.g., one that could be seen either as the letter B or the number 13) tended to report seeing the interpretation that assigned them
likelihood and the role of models in molecular phylogenetics.
 Mol. Biol. Evol.
, 2000
"... Methods such as maximum parsimony (MP) are frequently criticized as being statistically unsound and not being based on any ''model.'' On the other hand, advocates of MP claim that maximum likelihood (ML) has some fundamental problems. Here, we explore the connection between the ..."
Abstract

Cited by 70 (11 self)
 Add to MetaCart
and analyzed. These include models that allow a limited degree of nonindependence between sites (e.g., pairwise interactions in stem regions; Schöniger and von Haeseler 1994) and models that work with nonaligned sequences and explicitly model the insertiondeletion process as well as the site substitution
Cultural Biases in Economic Exchange",
, 2004
"... Abstract How much do cultural biases affect economic exchange? We try to answer this question by using the relative trust European citizens have for citizens of other countries. First, we document that this trust is affected not only by objective characteristics of the country being trusted, but al ..."
Abstract

Cited by 57 (4 self)
 Add to MetaCart
of the word rational only requires beliefs to be Bayesian. But the Bayesian paradigm does not address the question of the rationality of prior beliefs In particular, we focus on the effect that customary beliefs have on international trade and investments via the effect they have on the degree of trust
Algorithm and Complexity for a Network Assortativity Measure
, 2014
"... We show that finding a graph realization with the minimum Randic ́ index for a given degree sequence is solvable in polynomial time by formulating the problem as a minimum weight perfect bmatching problem. However, the realization found via this reduction is not guaranteed to be connected. Approxim ..."
Abstract
 Add to MetaCart
We show that finding a graph realization with the minimum Randic ́ index for a given degree sequence is solvable in polynomial time by formulating the problem as a minimum weight perfect bmatching problem. However, the realization found via this reduction is not guaranteed to be connected
The cavity method for counting spanning subgraphs subject to local constraints
, 2011
"... Using the theory of negative association for measures and the notion of random weak limits of sparse graphs, we establish the validity of the cavity method for counting spanning subgraphs subject to local constraints in asymptotically treelike graphs. Specifically, the corresponding free entropy de ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
explicitely. As an illustration, we provide an explicitlimit formula for the b−matching number of an ErdősRényi random graph with fixed average degree and diverging size, for any b ∈ N.
Results 1  10
of
199