Results 1 - 10
of
44,892
Average Performance Analysis for Thresholding
"... In this article is shown that with high probability the thresholding algorithm can recover signals that are sparse in a redundant dictionary as long as the 2-Babel function is growing slowly. This implies that it can succeed for sparsity levels up to the order of the ambient dimension. The theoreti ..."
Abstract
-
Cited by 28 (5 self)
- Add to MetaCart
. The theoretical bounds are illustrated with numerical simulations. As an application of the theory sensing dictionaries for optimal average performance are characterised and their performance is tested numerically.
Average Performance Analysis
, 2006
"... The purpose of measures in algorithm theory is to distinguish between “good ” and “bad ” algorithms. The main drawback of classical worst-case analysis is that one single “bad ” instance decides the performance of an algorithm. Moreover, worst-case instances are often quite artificial and often do n ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
not represent a “realistic ” or “typical ” instance of a problem. In this thesis, we are concerned with an approach that tries to adress this issue: average performance analysis. Consider an optimisation problem and let Alg be an arbitrary (online) algorithm for it. An adversary Adv chooses the distribution D
The Cache Performance and Optimizations of Blocked Algorithms
- In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems
, 1991
"... Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorithms operate on submatrices or blocks, so that data loaded into the faster levels of the memory hierarchy are reused. This ..."
Abstract
-
Cited by 574 (5 self)
- Add to MetaCart
given cache size, the block size that minimizes the expected number of cache misses is very small. Tailoring the block size according to the matrix size and cache parameters can improve the average performance and reduce the variance in performance for different matrix sizes. Finally, whenever possible
Performance Pay and Productivity
- AMERICAN ECONOMIC REVIEW
, 2000
"... Much of the theory in personnel economics relates to effects of monetary incentives on output, but the theory was untested because appropriate data were unavailable. A new data set for the Safelite Glass Corporation tests the predictions that average productivity will rise, the firm will attract a m ..."
Abstract
-
Cited by 508 (9 self)
- Add to MetaCart
Much of the theory in personnel economics relates to effects of monetary incentives on output, but the theory was untested because appropriate data were unavailable. A new data set for the Safelite Glass Corporation tests the predictions that average productivity will rise, the firm will attract a
The performance of mutual funds in the period 1945-1964
- JOURNAL OF FINANCE
, 1968
"... In this paper I derive a risk-adjusted measure of portfolio performance (now known as "Jensen's Alpha") that estimates how much a manager's forecasting ability contributes to the fund's returns. The measure is based on the theory of the pricing of capital assets by Sharpe (1 ..."
Abstract
-
Cited by 615 (1 self)
- Add to MetaCart
of the model and the properties of the performance measure suggested here are discussed in Section II. The evidence on mutual fund performance indicates not only that these 115 mutual funds were on average not able to predict security prices well enough to outperform a buy-the-marketand-hold policy, but also
Mining Sequential Patterns: Generalizations and Performance Improvements
- RESEARCH REPORT RJ 9994, IBM ALMADEN RESEARCH
, 1995
"... The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user-specified ..."
Abstract
-
Cited by 759 (5 self)
- Add to MetaCart
these generalized sequential patterns. Empirical evaluation using synthetic and real-life data indicates that GSP is much faster than the AprioriAll algorithm presented in [3]. GSP scales linearly with the number of data-sequences, and has very good scale-up properties with respect to the average data-sequence size.
Experimental Estimates of Education Production Functions
- Princeton University, Industrial Relations Section Working Paper No. 379
, 1997
"... This paper analyzes data on 11,600 students and their teachers who were randomly assigned to different size classes from kindergarten through third grade. Statistical methods are used to adjust for nonrandom attrition and transitions between classes. The main conclusions are (1) on average, performa ..."
Abstract
-
Cited by 529 (19 self)
- Add to MetaCart
This paper analyzes data on 11,600 students and their teachers who were randomly assigned to different size classes from kindergarten through third grade. Statistical methods are used to adjust for nonrandom attrition and transitions between classes. The main conclusions are (1) on average
Trading is hazardous to your wealth: The common stock investment performance of individual investors
- JOURNAL OF FINANCE
, 2000
"... Individual investors who hold common stocks directly pay a tremendous performance penalty for active trading. Of 66,465 households with accounts at a large discount broker during 1991 to 1996, those that trade most earn an annual return of 11.4 percent, while the market returns 17.9 percent. The ave ..."
Abstract
-
Cited by 494 (27 self)
- Add to MetaCart
. The average household earns an annual return of 16.4 percent, tilts its common stock investment toward high-beta, small, value stocks, and turns over 75 percent of its portfolio annually. Overconfidence can explain high trading levels and the resulting poor performance of individual investors. Our central
The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding
, 2001
"... In this paper, we present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any binary-input memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chos ..."
Abstract
-
Cited by 574 (9 self)
- Add to MetaCart
. Our results are based on the observation that the concentration of the performance of the decoder around its average performance, as observed by Luby et al. [1] in the case of a binary-symmetric channel and a binary message-passing algorithm, is a general phenomenon. For the particularly important
Results 1 - 10
of
44,892