Results 1  10
of
893
A Graduated Assignment Algorithm for Graph Matching
, 1996
"... A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated nonconvexity, twoway (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational comp ..."
Abstract

Cited by 373 (15 self)
 Add to MetaCart
, and attributed relational graph matching. To illustrate the performance of the algorithm, attributed relational graphs derived from objects are matched. Then, results from twentyfive thousand experiments conducted on 100 node random graphs of varying types (graphs with only zeroone links, weighted graphs
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
was concentrated at a single point the marginal probabilities should all be near zero or one; this is clearly not the case as can be seen in the figures. It might be expected that loopy propagation would only work well for graphs with large loops. However, our results, and previous results on turbo codes, show
ExOR: Opportunistic MultiHop Routing for Wireless Networks
 in SIGCOMM
, 2005
"... This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multihop wireless networks. ExOR chooses each hop of a packet’s route after the transmission for that hop, so that the choice can reflect which intermediate nodes actually r ..."
Abstract

Cited by 457 (0 self)
 Add to MetaCart
traditional routing. ExOR’s design faces the following challenges. The nodes that receive each packet must agree on their identities and choose one forwarder. The agreement protocol must have low overhead, but must also be robust enough that it rarely forwards a packet zero times or more than once. Finally
Distribution of the Optimal Value of a Stochastic Mixed ZeroOne Linear Optimization Problem under Objective Uncertainty
, 2011
"... This paper is motivated by the question to approximate the distribution of the completion time of a project network with random activity durations. In general, we consider the mixed zeroone linear optimization problem under objective uncertainty, and develop an approach to approximate the distribut ..."
Abstract
 Add to MetaCart
This paper is motivated by the question to approximate the distribution of the completion time of a project network with random activity durations. In general, we consider the mixed zeroone linear optimization problem under objective uncertainty, and develop an approach to approximate
SAIM – One Step Closer to ZeroConfiguration Link Discovery
"... Abstract. Link discovery plays a central role in the implementation of the Linked Data vision. In this demo paper, we present SAIM, a tool that aims to support users during the creation of highquality link specifications. The tool implements a simple but effective workflow to creating initial link ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. Link discovery plays a central role in the implementation of the Linked Data vision. In this demo paper, we present SAIM, a tool that aims to support users during the creation of highquality link specifications. The tool implements a simple but effective workflow to creating initial link
Computing person and firm effects using linked longitudinal employeremployee data,” Center for Economic Studies, US Census Bureau,
, 2002
"... Abstract In this paper we provide the exact formulas for the direct least squares estimation of statistical models that include both person and firm effects. We also provide an algorithm for determining the estimable functions of the person and firm effects (the identifiable effects). The computati ..."
Abstract

Cited by 141 (16 self)
 Add to MetaCart
the arbitrary equation determining the unidentified effect simply set that effect equal to zero, i.e, set one person or firm effect equal to zero in each group. Thus, the column associated with this effect can be removed from the reorganized design matrix and the column associated with the group mean
Zero Dynamics of Planar Biped Walkers with One Degree of Under Actuation
 in IFAC 2002, Bareclona
, 2002
"... Abstract: The zero dynamics of a hybrid model of bipedal walking are introduced and studied for a class of Nlink, planar robots with one degree of underactuation and outputs that depend only on the configuration variables. Asymptotically stable solutions of the zero dynamics correspond to asymptoti ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract: The zero dynamics of a hybrid model of bipedal walking are introduced and studied for a class of Nlink, planar robots with one degree of underactuation and outputs that depend only on the configuration variables. Asymptotically stable solutions of the zero dynamics correspond
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
, let q ji be an indicator equaling one if at least one syndication relationship exists in which VC j was the lead investor and VC i was a syndicate member, and zero otherwise. VC i's indegree then equals Σ i q ji . Outdegree is a measure of a VC's ability to generate future co
Entropy and Variational Principle for onedimensional Lattice Systems with a general apriori probability: positive and zero temperature
"... We generalize several results of the classical theory of Thermodynamic Formalism by considering a compact metric space M as the state space. We analyze the shift acting on M N and consider a general apriori probability for defining the Transfer (Ruelle) operator. We study potentials A which can de ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
depend on the infinite set of coordinates in M N . We define entropy and by its very nature it is always a nonpositive number. The concepts of entropy and transfer operator are linked. If M is not a finite set there exist Gibbs states with arbitrary negative value of entropy. Invariant probabilities
PRINCIPAL ANALYTIC LINK THEORY IN HOMOLOGY SPHERE LINKS
"... For the link M of a normal complex surface singularity (X, 0) we ask when a knot K ⊂ M exists for which the answer to whether K is the link of the zero set of some analytic germ (X, 0) → (C, 0) affects the analytic structure on (X, 0). We show that if M is an integral homology sphere then such a k ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
For the link M of a normal complex surface singularity (X, 0) we ask when a knot K ⊂ M exists for which the answer to whether K is the link of the zero set of some analytic germ (X, 0) → (C, 0) affects the analytic structure on (X, 0). We show that if M is an integral homology sphere then such a
Results 1  10
of
893