Results 1  10
of
2,828
Robust DataDriven Inference in the RegressionDiscontinuity Design
"... Abstract. This article introduces three Stata commands useful to conduct “robust” datadriven (i.e., fully automatic) statistical inference in the regressiondiscontinuity (RD) design. First, we present the command rdrobust that implements the more robust biascorrected confidence intervals for sharp ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
proposed in the RD literature. Third, we introduce the command rdbinselect, which implements a novel datadriven optimal length choice of evenlyspaced bins employed to approximate the underlying regression functions by local sample means, and discuss how this command may be used to construct commonly
Insiders and Outsiders: The Choice between Informed and Arm'sLength Debt
, 1991
"... While the benefits of bank financing are relatively well understood, the costs are not. This paper argues that while informed banks make flexible financial decisions which prevent a firm's projects from going awry, the cost of this credit is that banks have bargaining power over the firm's ..."
Abstract

Cited by 868 (16 self)
 Add to MetaCart
's profits, once projects have begun. The firm's portfolio choice of borrowing source and the choice of priority for its debt claims attempt to optimally circumscribe the powers of banks.
Dynamic Textures
, 2002
"... Dynamic textures are sequences of images of moving scenes that exhibit certain stationarity properties in time; these include seawaves, smoke, foliage, whirlwind etc. We present a novel characterization of dynamic textures that poses the problems of modeling, learning, recognizing and synthesizing ..."
Abstract

Cited by 377 (18 self)
 Add to MetaCart
of secondorder stationary processes, we identify the model suboptimally in closedform. Once learned, a model has predictive power and can be used for extrapolating synthetic sequences to infinite length with negligible computational cost. We present experimental evidence that, within our framework, even
The RC5 Encryption Algorithm
, 1995
"... Abstract. This document describes the RC5 encryption algorithm. RC5 is a fast symmetric block cipher suitable for hardware or software implementations. A novel feature of RC5 is the heavy use of datadependent rotations. RC5 has a variable word size, a variable number of rounds, and a variablelengt ..."
Abstract

Cited by 363 (7 self)
 Add to MetaCart
Abstract. This document describes the RC5 encryption algorithm. RC5 is a fast symmetric block cipher suitable for hardware or software implementations. A novel feature of RC5 is the heavy use of datadependent rotations. RC5 has a variable word size, a variable number of rounds, and a variablelength
Periodogram with varying and datadriven window length
, 1998
"... The shorttime Fourier transform and the corresponding periodogram give biased estimates of the instantaneous frequency (IF) if the IF in question is a nonlinear function of time. In the case of noisy signals, the optimal choice of the window length, based on asymptotic formulae for the variance and ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
based IF estimator with a timevarying and datadriven window length which is able to provide the accuracy close to the one that could be achieved if the smoothness of the IF were known in advance. The developed algorithm uses only the estimates of the IF and the formula for the variance of these estimates
Clustering by compression
 IEEE Transactions on Information Theory
, 2005
"... Abstract—We present a new method for clustering based on compression. The method does not use subjectspecific features or background knowledge, and works as follows: First, we determine a parameterfree, universal, similarity distance, the normalized compression distance or NCD, computed from the l ..."
Abstract

Cited by 297 (25 self)
 Add to MetaCart
the lengths of compressed data files (singly and in pairwise concatenation). Second, we apply a hierarchical clustering method. The NCD is not restricted to a specific application area, and works across application area boundaries. A theoretical precursor, the normalized information distance, co
Highorder entropycompressed text indexes
, 2003
"... We present a novel implementation of compressed suffix arrays exhibiting new tradeoffs between search time and space occupancy for a given text (or sequence) of n symbols over an alphabet Σ, where each symbol is encoded by lg Σ  bits. We show that compressed suffix arrays use just nHh + O(n lg lg ..."
Abstract

Cited by 267 (22 self)
 Add to MetaCart
n / lg Σ  n) bits, while retaining full text indexing functionalities, such as searching any pattern sequence of length m in O(m lg Σ  + polylog(n)) time. The term Hh ≤ lg Σ  denotes the hthorder empirical entropy of the text, which means that our index is nearly optimal in space apart from
ContextDependent Pretrained Deep Neural Networks for Large Vocabulary Speech Recognition
 IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING
, 2012
"... We propose a novel contextdependent (CD) model for large vocabulary speech recognition (LVSR) that leverages recent advances in using deep belief networks for phone recognition. We describe a pretrained deep neural network hidden Markov model (DNNHMM) hybrid architecture that trains the DNN to pr ..."
Abstract

Cited by 254 (50 self)
 Add to MetaCart
We propose a novel contextdependent (CD) model for large vocabulary speech recognition (LVSR) that leverages recent advances in using deep belief networks for phone recognition. We describe a pretrained deep neural network hidden Markov model (DNNHMM) hybrid architecture that trains the DNN
Distributionally Robust Optimization under Moment Uncertainty with Application to DataDriven Problems
"... Stochastic programs can effectively describe the decisionmaking problem in an uncertain environment. Unfortunately, such programs are often computationally demanding to solve. In addition, their solutions can be misleading when there is ambiguity in the choice of a distribution for the random param ..."
Abstract

Cited by 60 (4 self)
 Add to MetaCart
Stochastic programs can effectively describe the decisionmaking problem in an uncertain environment. Unfortunately, such programs are often computationally demanding to solve. In addition, their solutions can be misleading when there is ambiguity in the choice of a distribution for the random
Instantaneous frequency estimation using the Wigner distribution with varying and datadriven window length
 IEEE Trans. Signal Process. SP46
, 1998
"... Abstract—Estimation of the instantaneous frequency (IF) of a harmonic complexvalued signal with an additive noise using the Wigner distribution is considered. If the IF is a nonlinear function of time, the bias of the estimate depends on the window length. The optimal choice of the window length, b ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
an adaptive IF estimator with a timevarying and datadriven window length, which is able to provide quality close to what could be achieved if the smoothness of the IF were known in advance. The algorithm uses the asymptotic formula for the variance of the estimator only. Its value may be easily obtained
Results 1  10
of
2,828