Results 1 - 10
of
103,105
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
is highly sensitive to the stride of data accesses and the size of the blocks, and can cause wide variations in machine performance for different matrix sizes. The conventional wisdom of trying to use the entire cache, or even a fixed fraction of the cache, is incorrect. If a fixed block size is used for a
How much should we trust differences-in-differences estimates?
, 2003
"... Most papers that employ Differences-in-Differences estimation (DD) use many years of data and focus on serially correlated outcomes but ignore that the resulting standard errors are inconsistent. To illustrate the severity of this issue, we randomly generate placebo laws in state-level data on femal ..."
Abstract
-
Cited by 828 (1 self)
- Add to MetaCart
Most papers that employ Differences-in-Differences estimation (DD) use many years of data and focus on serially correlated outcomes but ignore that the resulting standard errors are inconsistent. To illustrate the severity of this issue, we randomly generate placebo laws in state-level data
Algorithms for Non-negative Matrix Factorization
- In NIPS
, 2001
"... Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown to minim ..."
Abstract
-
Cited by 1246 (5 self)
- Add to MetaCart
Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown
MATRIX FACTORIZATION TECHNIQUES FOR RECOMMENDER SYSTEMS
- IEEE COMPUTER
, 2009
"... As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern co ..."
Abstract
-
Cited by 593 (4 self)
- Add to MetaCart
As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern
Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes
- J. COMP. PHYS
, 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract
-
Cited by 1010 (2 self)
- Add to MetaCart
are worth striving for. It is shown that these features can be obtained by constructing a matrix with a certain “Property U.” Matrices having this property are exhibited for the equations of steady and unsteady gasdynamics. In order to construct them, it is found helpful to introduce “parameter vectors
The relationship between return and market value of common stocks
- Journal of Financial Economics
, 1981
"... This study examines the empirical relattonship between the return and the total market value of NYSE common stocks. It is found that smaller firms have had htgher risk adjusted returns, on average, than larger lirms. This ‘size effect ’ has been in existence for at least forty years and is evidence ..."
Abstract
-
Cited by 791 (0 self)
- Add to MetaCart
that the capital asset pricing model is misspecttied. The size elfect is not linear in the market value; the main effect occurs for very small tirms while there is little difference m return between average sized and large firms. It IS not known whether size per se is responsible for the effect or whether size
Shape and motion from image streams under orthography: a factorization method
- INTERNATIONAL JOURNAL OF COMPUTER VISION
, 1992
"... Inferring scene geometry and camera motion from a stream of images is possible in principle, but is an ill-conditioned problem when the objects are distant with respect to their size. We have developed a factorization method that can overcome this difficulty by recovering shape and motion under orth ..."
Abstract
-
Cited by 1094 (38 self)
- Add to MetaCart
Inferring scene geometry and camera motion from a stream of images is possible in principle, but is an ill-conditioned problem when the objects are distant with respect to their size. We have developed a factorization method that can overcome this difficulty by recovering shape and motion under
Multivariable Feedback Control: Analysis
- span (B∗) und Basis B∗ = { ω1
, 2005
"... multi-input, multi-output feed-back control design for linear systems using the paradigms, theory, and tools of robust con-trol that have arisen during the past two decades. The book is aimed at graduate students and practicing engineers who have a basic knowledge of classical con-trol design and st ..."
Abstract
-
Cited by 564 (24 self)
- Add to MetaCart
and state-space con-trol theory for linear systems. A basic knowledge of matrix theory and linear algebra is required to appreciate and digest the material offered. This edition is a revised and expanded version of the first edition, which was published in 1996. The size of the
A comparison of event models for Naive Bayes text classification
, 1998
"... Recent work in text classification has used two different first-order probabilistic models for classification, both of which make the naive Bayes assumption. Some use a multi-variate Bernoulli model, that is, a Bayesian Network with no dependencies between words and binary word features (e.g. Larkey ..."
Abstract
-
Cited by 1025 (26 self)
- Add to MetaCart
Recent work in text classification has used two different first-order probabilistic models for classification, both of which make the naive Bayes assumption. Some use a multi-variate Bernoulli model, that is, a Bayesian Network with no dependencies between words and binary word features (e
A Direct Adaptive Method for Faster Backpropagation Learning: The RPROP Algorithm
- IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS
, 1993
"... A new learning algorithm for multilayer feedforward networks, RPROP, is proposed. To overcome the inherent disadvantages of pure gradient-descent, RPROP performs a local adaptation of the weight-updates according to the behaviour of the errorfunction. In substantial difference to other adaptive tech ..."
Abstract
-
Cited by 938 (34 self)
- Add to MetaCart
A new learning algorithm for multilayer feedforward networks, RPROP, is proposed. To overcome the inherent disadvantages of pure gradient-descent, RPROP performs a local adaptation of the weight-updates according to the behaviour of the errorfunction. In substantial difference to other adaptive
Results 1 - 10
of
103,105