Results 1  10
of
172
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
to make the concept of centrality more precise. 3 Consider the network illustrated in In graph theory, a network such as the one illustrated in 6 Networks are not static. Relationships may change, and entry to and exit from the network may change each actor's centrality. We therefore construct our
TSP tours in cubic graphs: Beyond 4/3
, 2015
"... After a sequence of improvements Boyd et al. [TSP on cubic and subcubic graphs, Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 6655, Springer, Heidelberg, 2011, pp. 65–77] proved that any 2connected graph whose n vertices have degree 3, i.e., a cubic 2connected ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
graph, has a Hamiltonian tour of length at most (4/3)n, establishing in particular that the integrality gap of the subtour LP is at most 4/3 for cubic 2connected graphs and matching the conjectured value of the famous 4/3 conjecture. In this paper we improve upon this result by designing an algorithm
doi:10.1093/comjnl/bxp026 A Digest and Pattern MatchingBased Intrusion Detection Engine
, 2008
"... Intrusion detection/prevention systems (IDSs/IPSs) heavily rely on signature databases and pattern matching (PM) techniques to identify network attacks. The engines of such systems often employ traditional PM algorithms to search for telltale patterns in network flows. The observations that realwor ..."
Abstract
 Add to MetaCart
Intrusion detection/prevention systems (IDSs/IPSs) heavily rely on signature databases and pattern matching (PM) techniques to identify network attacks. The engines of such systems often employ traditional PM algorithms to search for telltale patterns in network flows. The observations that real
TO CODE OR NOT TO CODE
, 2002
"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."
Abstract
 Add to MetaCart
de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:
Implications of Analyticity to Mass Gap, Color Confinement and Infrared Fixed Point in Yang–Mills theory
, 2003
"... ar ..."
Nearoptimal algorithms for Unique Games
 In Proceedings of the 38th Annual ACM Symposium on Theory of Computing
, 2006
"... Unique games are constraint satisfaction problems that can be viewed as a generalization of MaxCut to a larger domain size. The Unique Games Conjecture states that it is hard to distinguish between instances of unique games where almost all constraints are satisfiable and those where almost none ar ..."
Abstract

Cited by 46 (8 self)
 Add to MetaCart
for the problem and their performance almost matches the integrality gap of this relaxation. Our results are near optimal if the Unique Games Conjecture is true, i.e. any improvement (beyond low order terms) would refute the conjecture. 1
Quantizing string theory in AdS5 × S 5 : Beyond the ppwave”, Nucl. Phys
 in the nearBMN limit”, hepth/0405153
"... In a certain kinematic limit, where the effects of spacetime curvature (and other background fields) greatly simplify, the lightcone gauge worldsheet action for a type IIB superstring on AdS5 × S 5 reduces to that of a free field theory. It has been conjectured by Berenstein, Maldacena, and Nastas ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
limits. As a step toward verifying this larger conjecture, we have computed the complete set of first curvature corrections to the spectrum of lightcone gauge string theory that arises in the expansion of AdS5 ×S 5 about the planewave limit. We find that the string spectrum matches the dimensions
COSMOLOGICAL MODELS OF MODIFIED GRAVITY
, 2013
"... The recent discovery of dark energy has prompted an investigation of ways in which the accelerated expansion of the universe can be realized. In this dissertation, we present two separate projects related to dark energy. The first project analyzes a class of braneworld models in which multiple brane ..."
Abstract
 Add to MetaCart
The recent discovery of dark energy has prompted an investigation of ways in which the accelerated expansion of the universe can be realized. In this dissertation, we present two separate projects related to dark energy. The first project analyzes a class of braneworld models in which multiple branes float in a fivedimensional antide Sitter bulk, while the second investigates a class of dark energy models from an effective field theory perspective. Investigations of models including extra dimensions have led to modifications of gravity involving a number of interesting features. In particular, the RandallSundrum model is wellknown for achieving an amelioration of the hierarchy problem. However, the basic model relies on Minkowski branes and is subject to solar system constraints in the absence of a radion stabilization mechanism. We present a method by which a fourdimensional lowenergy description can be obtained for braneworld scenarios, allowing for a number of generalizations to the original models. This method is applied to orbifolded and uncompactified Nbrane models, deriving an effective fourdimensional action. The parameter space of this theory is constrained using observational evidence, and it is found that the generalizations do not weaken solar system constraints on the original model. Furthermore, we find that general
String Variable Grammar: A Logic Grammar Formalism For The Biological Language Of DNA
, 1993
"... this paper, we present a generalized form of SVG, which supports additional biologicallyrelevant operations by going beyond homomorphisms, instead uniformly applying substitutions in either a forward or reverse direction (see Definition 2.1) to bindings of logic variables. We give a constructive pr ..."
Abstract

Cited by 51 (2 self)
 Add to MetaCart
this paper, we present a generalized form of SVG, which supports additional biologicallyrelevant operations by going beyond homomorphisms, instead uniformly applying substitutions in either a forward or reverse direction (see Definition 2.1) to bindings of logic variables. We give a constructive
Results 1  10
of
172