Results 1  10
of
263
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
longstanding relationships with (Corwin and Schultz (2005)). In the same spirit, networks feature prominently in the venture capital industry. VCs tend to syndicate their investments with other VCs, rather than investing alone (Lerner (1994a)). They are thus bound by their current and past investments
Languages Defined With Modular Counting Quantifiers
 Information and Computation
, 2001
"... . We prove that a regular language defined by a boolean combination of generalized \Sigma 1sentences built using modular counting quantifiers can be defined by a boolean combination of \Sigma 1sentences in which only regular numerical predicates appear. The same statement, with "\Sigma 1 &quo ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
" replaced by "firstorder" is equivalent to the conjecture that the nonuniform circuit complexity class ACC is strictly contained in NC 1 : The argument introduces some new techniques, based on a combination of semigroup theory and Ramsey theory, which may shed some light
On the Learnability of Counting Functions
"... We examine the learnability of concepts based on counting functions. A counting function is a generalization of a parity function in which the weighted sum of n inputs is tested for equivalence to some value k modulo N. The concepts we study therefore generalize many commonly studied boolean functio ..."
Abstract
 Add to MetaCart
decomposition of N. When counting functions in the disjunction have distinct counting moduli {Ni}, we show that α(lcm(Ni))n + 1 equivalence queries are sufficient. We also give lower bounds on the number of equivalence queries required to learn diagonal DOCFs (and therefore general DOCFs) and provide a matching
Network Equivalence in the Presence of an Eavesdropper
"... Abstract—We consider networks of noisy degraded wiretap channels in the presence of an eavesdropper. For the case where the eavesdropper can wiretap at most one channel at a time, we show that the secrecy capacity region, for a broad class of channels and any given network topology and communication ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
and communication demands, is equivalent to that of a corresponding network where each noisy wiretap channel is replaced by a noiseless wiretap channel. Thus in this case there is a separation between wiretap channel coding on each channel and secure network coding on the resulting noiseless network. We show
A LagrangianDNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
, 2013
"... We propose an efficient computational method for linearly constrained quadratic optimization problems (QOPs) with complementarity constraints based on their Lagrangian and doubly nonnegative (DNN) relaxation and firstorder algorithms. The simplified LagrangianCPP relaxation of such QOPs proposed b ..."
Equivalent Models for Multiterminal Channels
 IEEE INFORMATION THEORY WORKSHOP
, 2011
"... The recently introduced network equivalence results are used to create bitpipe models that can replace multiterminal channels within a discrete memoryless network. The goal is to create a set of simple “components” or “blocks” that can be substituted for the channel in such a way that the resultin ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
that the resulting network is capable of emulating the operation of the original one. We develop general upper and lower bounding models for the multiple access channel and for a class of broadcast channels. These bounds are sharp in the sense that there exists networks where the original channel can achieve
Complexity of counting subgraphs: Only the boundedness of the vertexcover number counts
"... Abstract—For a class C of graphs, #Sub(C) is the counting problem that, given a graph H from C and an arbitrary graph G, asks for the number of subgraphs of G isomorphic to H. It is known that if C has bounded vertexcover number (equivalently, the size of the maximum matching in C is bounded), the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—For a class C of graphs, #Sub(C) is the counting problem that, given a graph H from C and an arbitrary graph G, asks for the number of subgraphs of G isomorphic to H. It is known that if C has bounded vertexcover number (equivalently, the size of the maximum matching in C is bounded
COUNTING ZEROS OF CLOSED 1FORMS
, 1999
"... Abstract. This paper suggests new topological lower bounds for the number of zeros of closed 1forms within a given cohomology class. The main new technical tool is the deformation complex, which allows to pass to a singular limit and reduce the original problem with closed 1form to a traditional p ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. This paper suggests new topological lower bounds for the number of zeros of closed 1forms within a given cohomology class. The main new technical tool is the deformation complex, which allows to pass to a singular limit and reduce the original problem with closed 1form to a traditional
Forum Mathematicum The number of configurations in lattice point counting I
, 2010
"... Abstract. When a strictly convex plane set S moves by translation, the set J of points of the integer lattice that lie in S changes. The number K of equivalence classes of sets J under lattice translations (configurations) is bounded in terms of the area of the BrunnMinkowski difference set of S. ..."
Abstract
 Add to MetaCart
Abstract. When a strictly convex plane set S moves by translation, the set J of points of the integer lattice that lie in S changes. The number K of equivalence classes of sets J under lattice translations (configurations) is bounded in terms of the area of the BrunnMinkowski difference set of S
On the behaviors of affine equivalent Sboxes regarding differential and linear attacks?
"... Abstract. This paper investigates the effect of affine transformations of the Sbox on the maximal expected differential probability MEDP and linear potential MELP over two rounds of a substitutionpermutation network, when the diffusion layer is linear over the finite field defined by the Sbox alpha ..."
Abstract
 Add to MetaCart
alphabet. It is mainly motivated by the fact that the 2round MEDP and MELP of the AES both increase when the AES Sbox is replaced by the inversion in F28. Most notably, we give new upper bounds on these two quantities which are not invariant under affine equivalence. Moreover, within a given equivalence
Results 1  10
of
263