Results 1  10
of
6,110,403
Small Byzantine Quorum Systems
 DISTRIBUTED COMPUTING
, 2001
"... In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channelsone for selfverifying data and the other for any data. Our protocols tolerate Byzantine failures with fewer servers than existing solutions by eliminating nonessential work in ..."
Abstract

Cited by 483 (49 self)
 Add to MetaCart
links or machines. We consider running synchronous and asynchronous Byzantine Quorum protocols over synchronous networks and conclude that, surprisingly, "selftiming" asynchronous Byzantine protocols may offer significant advantages for many synchronous networks when network time
On limits of wireless communications in a fading environment when using multiple antennas
 Wireless Personal Communications
, 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bitrates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multielement array (M ..."
Abstract

Cited by 2363 (14 self)
 Add to MetaCart
to the baseline n = 1 case, which by Shannon’s classical formula scales as one more bit/cycle for every 3 dB of signaltonoise ratio (SNR) increase, remarkably with MEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take
Learning and development in neural networks: The importance of starting small
 Cognition
, 1993
"... It is a striking fact that in humans the greatest learnmg occurs precisely at that point in time childhood when the most dramatic maturational changes also occur. This report describes possible synergistic interactions between maturational change and the ability to learn a complex domain (language ..."
Abstract

Cited by 518 (18 self)
 Add to MetaCart
It is a striking fact that in humans the greatest learnmg occurs precisely at that point in time childhood when the most dramatic maturational changes also occur. This report describes possible synergistic interactions between maturational change and the ability to learn a complex domain
GPSless Low Cost Outdoor Localization For Very Small Devices
, 2000
"... Instrumenting the physical world through large networks of wireless sensor nodes, particularly for applications like environmental monitoring of water and soil, requires that these nodes be very small, light, untethered and unobtrusive. The problem of localization, i.e., determining where a given no ..."
Abstract

Cited by 994 (29 self)
 Add to MetaCart
Instrumenting the physical world through large networks of wireless sensor nodes, particularly for applications like environmental monitoring of water and soil, requires that these nodes be very small, light, untethered and unobtrusive. The problem of localization, i.e., determining where a given
Improving DirectMapped Cache Performance by the Addition of a Small FullyAssociative Cache and Prefetch Buffers
, 1990
"... ..."
Factoring polynomials with rational coefficients
 MATH. ANN
, 1982
"... In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomia ..."
Abstract

Cited by 982 (11 self)
 Add to MetaCart
polynomials feZ[X] into irreducible factors in Z[X]. Here we call f ~ Z[X] primitive if the greatest common divisor of its coefficients (the content of f) is 1. Our algorithm performs well in practice, cf. [8]. Its running time, measured in bit operations, is O(nl2+n9(log[fD3). Here f~Tl[X] is the polynomial
Investing for the long run when returns are predictable
 Journal of Finance
, 2000
"... We examine how the evidence of predictability in asset returns affects optimal portfolio choice for investors with long horizons. Particular attention is paid to estimation risk, or uncertainty about the true values of model parameters. We find that even after incorporating parameter uncertainty, th ..."
Abstract

Cited by 438 (0 self)
 Add to MetaCart
We examine how the evidence of predictability in asset returns affects optimal portfolio choice for investors with long horizons. Particular attention is paid to estimation risk, or uncertainty about the true values of model parameters. We find that even after incorporating parameter uncertainty, there is enough predictability in returns to make investors allocate substantially more to stocks, the longer their horizon. Moreover, the weak statistical significance of the evidence for predictability makes it important to take estimation risk into account; a longhorizon investor who ignores it may overallocate to stocks by a sizeable amount. ONE OF THE MORE STRIKING EMPIRICAL FINDINGS in recent financial research is the evidence of predictability in asset returns. 1 In this paper we examine the implications of this predictability for an investor seeking to make sensible portfolio allocation decisions. We approach this question from the perspective of horizon effects: Given the evidence of predictability in returns, should a longhorizon investor allocate his wealth differently from a shorthorizon investor? The motivation for thinking about the problem in these terms is the classic work of Samuelson ~1969! and Merton ~1969!. They show that if asset returns are i.i.d., an investor with power utility who rebalances his portfolio optimally should choose the same asset allocation, regardless of investment horizon. In light of the growing body of evidence that returns are predictable, the investor’s horizon may no longer be irrelevant. The extent to which the horizon does play a role serves as an interesting and convenient way of thinking about how predictability affects portfolio choice. Moreover, the results may shed light on the common but controversial advice that investors with long horizons should allocate more heavily to stocks. 2
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1055 (1 self)
 Add to MetaCart
the infimum is with respect to all auxiliary random variables Z (which take values in a finite set 3) that satisfy: i) Y,Z conditiofally independent given X; ii) there exists a functionf: “Y x E +.%, such that E[D(X,f(Y,Z))] 5 d. Let Rx, y(d) be the ratedistortion function which results when the encoder
Results 1  10
of
6,110,403