Results 1  10
of
997
Resource allocation and crosslayer control in wireless networks
 Foundations and Trends in Networking
, 2006
"... Information flow in a telecommunication network is accomplished through the interaction of mechanisms at various design layers with the end goal of supporting the information exchange needs of the applications. In wireless networks in particular, the different layers interact in a nontrivial manner ..."
Abstract

Cited by 276 (59 self)
 Add to MetaCart
Information flow in a telecommunication network is accomplished through the interaction of mechanisms at various design layers with the end goal of supporting the information exchange needs of the applications. In wireless networks in particular, the different layers interact in a nontrivial manner
Learning in the Presence of Malicious Errors
 SIAM Journal on Computing
, 1993
"... In this paper we study an extension of the distributionfree model of learning introduced by Valiant [23] (also known as the probably approximately correct or PAC model) that allows the presence of malicious errors in the examples given to a learning algorithm. Such errors are generated by an advers ..."
Abstract

Cited by 184 (12 self)
 Add to MetaCart
nontrivial rates of malicious errors, and equivalences between problems of learning with errors and standard combinatorial optimization problems. 1 Introduction In this paper, we study a practical extension to Valiant's distributionfree model of learning: the presence of errors (possibly maliciously
A generalization of the nontriviality theorem of Serre
 Proc. Amer. Math. Soc
"... Abstract. We generalize the classical theorem of Serre on the nontriviality of infinitely many homotopy groups of 1connected finite CWcomplexes to CWcomplexes where the cohomology groups either grow too fast or do not grow faster than a certain rate given by connectivity. For example, this resul ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We generalize the classical theorem of Serre on the nontriviality of infinitely many homotopy groups of 1connected finite CWcomplexes to CWcomplexes where the cohomology groups either grow too fast or do not grow faster than a certain rate given by connectivity. For example
The nontrivial random walk of stock prices
 European Journal of Physics, B
"... We investigate the random walk of prices by developing a simple model relating the properties of the signs and absolute values of individual price changes to the diffusion rate (volatility) of prices at longer time scales. We find that for one hour intervals this model consistently overpredicts th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate the random walk of prices by developing a simple model relating the properties of the signs and absolute values of individual price changes to the diffusion rate (volatility) of prices at longer time scales. We find that for one hour intervals this model consistently over
The distribution of the largest nontrivial eigenvalues in families of random regular graphs
 EXPER. MATH
, 2008
"... Recently Friedman proved Alon’s conjecture for many families of dregular graphs, namely that given any ǫ> 0 “most ” graphs have their largest nontrivial eigenvalue at most 2 √ d − 1+ ǫ in absolute value; if the absolute value of the largest nontrivial eigenvalue is at most 2 √ d − 1 then the ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Recently Friedman proved Alon’s conjecture for many families of dregular graphs, namely that given any ǫ> 0 “most ” graphs have their largest nontrivial eigenvalue at most 2 √ d − 1+ ǫ in absolute value; if the absolute value of the largest nontrivial eigenvalue is at most 2 √ d − 1
ReedSolomon Subcodes with Nontrivial Traces: Distance Properties and SoftDecision Decoding
, 2008
"... ReedSolomon (RS) codes over GF(2 m) have traditionally been the most popular nonbinary codes in almost all practical applications. The distance properties of RS codes result in excellent performance under harddecision boundeddistance decoding. However, efficient and implementable soft decoding ..."
Abstract
 Add to MetaCart
for highrate (about 0.9) RS codes over large fields (GF(256), say) continues to remain a subject of research with a promise of further coding gains. In this work, our objective is to propose and investigate 2 mary codes with nontrivial binary trace codes as an alternative to RS codes. We derive bounds
Nontrivial quadratic approximations to zero of a family of cubic Pisot numbers
, 2003
"... This paper gives exact rates of quadratic approximations to an infinite class of cubic Pisot numbers. We show that for any cubic Pisot number q, with minimal polynomial p, such that p(0) = −1, and where p has only one real root, then there exists a C(q), explicitly given here, such that: (1) For a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper gives exact rates of quadratic approximations to an infinite class of cubic Pisot numbers. We show that for any cubic Pisot number q, with minimal polynomial p, such that p(0) = −1, and where p has only one real root, then there exists a C(q), explicitly given here, such that: (1
Efficient Oblivious Transfer Protocols Achieving a NonZero Rate from Any NonTrivial Noisy Correlation
"... Oblivious transfer (OT) is a twoparty primitive which is one of the cornerstones of modern cryptography. We focus on providing informationtheoretic security for both parties, hence building OT assuming noisy resources (channels or correlations) available to them. This primitive is about transmitti ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
transmitting two strings such that the receiver can obtain one (and only one) of them, while the sender remains ignorant of this choice. Recently, Winter and Nascimento proved that oblivious transfer capacity is positive for any nontrivial discrete memoryless channel or correlation in the case of passive
DomainWall Induced Quark Masses in TopologicallyNontrivial Background
, 2000
"... In the domainwall formulation of chiral fermion, the finite separation between domainwalls (Ls) induces an effective quark mass (meff) which complicates the chiral limit. In this work, we study the size of the effective mass as the function of Ls and the domainwall height m0 by calculating the sm ..."
Abstract
 Add to MetaCart
the smallest eigenvalue of the hermitian domainwall Dirac operator in the topologicallynontrivial background fields. We find that, just like in the free case, meff decreases exponentially in Ls with a rate depending on m0. However, quantum fluctuations amplify the wall effects significantly. Our numerical
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
examine both the performance of the VC fund and of the fund's portfolio companies. At the fund level, we examine "exit rates" in the absence of publicly available data on VC fund returns. We define a fund's exit rate as the fraction of portfolio companies that are successfully exited
Results 1  10
of
997