• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 136
Next 10 →

Whom You Know Matters: Venture Capital Networks and Investment Performance,

by Yael Hochberg , Alexander Ljungqvist , Yang Lu , Steve Drucker , Jan Eberly , Eric Green , Yaniv Grinstein , Josh Lerner , Laura Lindsey , Max Maksimovic , Roni Michaely , Maureen O'hara , Ludo Phalippou Mitch Petersen , Jesper Sorensen , Per Strömberg Morten Sorensen , Yael Hochberg , Johnson - Journal of Finance , 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm's-length, spot-market 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
statistically significant, they are also very large economically: IRRs increase by between 11 and 14 percentage points from the 15% sample average for one-standard-deviation increases in indegree and eigenvector. The adjusted R 2 s in all five models are high, ranging from 27.8% for the outdegree specification

An Infinite Set of Ward Identities for Adiabatic Modes in Cosmology

by Kurt Hinterbichlera, Lam Huib, Justin Khouryc
"... We show that the correlation functions of any single-field cosmological model with constant growing-modes are constrained by an infinite number of novel consistency relations, which relate N + 1-point correlation functions with a soft-momentum scalar or tensor mode to a symmetry transformation on N- ..."
Abstract - Add to MetaCart
We show that the correlation functions of any single-field cosmological model with constant growing-modes are constrained by an infinite number of novel consistency relations, which relate N + 1-point correlation functions with a soft-momentum scalar or tensor mode to a symmetry transformation on N

Chapter 12 Rough Sets and Rough Logic: A KDD Perspective

by Zdzis Law Pawlak, Lech Polkowski, Andrzej Skowron
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract - Add to MetaCart
Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations

COSMOLOGICAL MODELS OF MODIFIED GRAVITY

by Jolyon Keith Bloomfield, Ph. D , 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

Fast Error Correction for Large Data Sets

by Michael Mitzenmacher, George Varghese
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

new algorithm to compute fusion coecients By

by Christian Korff
"... This is a proceedings article reviewing a recent combinatorial construction of the bsu(n)k WZNW fusion ring by C. Stroppel and the author. It contains one novel aspect: the explicit derivation of an algorithm for the computation of fusion coecients dierent from the Kac-Walton formula. The discussion ..."
Abstract - Add to MetaCart
This is a proceedings article reviewing a recent combinatorial construction of the bsu(n)k WZNW fusion ring by C. Stroppel and the author. It contains one novel aspect: the explicit derivation of an algorithm for the computation of fusion coecients dierent from the Kac-Walton formula

Akademisk avhandling för teknisk doktorsexamen vid

by Kungl Tekniska Högskolan, Kth Tryck , 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract - Add to MetaCart
of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an n-path of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond

RESEARCH ARTICLE Efficient Modeling of MS/MS Data for Metabolic Flux Analysis

by Tomer Shlomi
"... Metabolic flux analysis (MFA) is a widely used method for quantifying intracellular metabolic fluxes. It works by feeding cells with isotopic labeled nutrients, measuring metabolite isoto-pic labeling, and computationally interpreting the measured labeling data to estimate flux. Tandem mass-spectrom ..."
Abstract - Add to MetaCart
Metabolic flux analysis (MFA) is a widely used method for quantifying intracellular metabolic fluxes. It works by feeding cells with isotopic labeled nutrients, measuring metabolite isoto-pic labeling, and computationally interpreting the measured labeling data to estimate flux. Tandem mass

new algorithm to compute fusion coefficients By

by Rims Kôkyûroku Bessatsu, Christian Korff
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

RICE UNIVERSITY Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing

by Jason Noah Laska , 2011
"... The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of t ..."
Abstract - Add to MetaCart
The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of the signal complexity. In practice, this enables lower sampling rates that can be more easily achieved by current hardware designs. The primary bottleneck that limits ADC sam-pling rates is quantization, i.e., higher bit-depths impose lower sampling rates. Thus, the decreased sampling rates of CS ADCs accommodate the otherwise limiting quantizer of conventional ADCs. In this thesis, we consider a different approach to CS ADC by shifting towards lower quantizer bit-depths rather than lower sampling rates. We explore the extreme case where each measurement is quantized to just one bit, representing its sign. We develop a new theoretical framework to analyze this extreme case and develop new algorithms for signal reconstruction from such coarsely quantized measurements. The 1-bit CS framework leads us to scenarios where it may be more appropriate to reduce bit-depth instead of sampling rate. We find that there exist two distinct regimes of operation that correspond to high/low signal-to-noise ratio (SNR). In the measurement
Next 10 →
Results 1 - 10 of 136
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University