Results 1  10
of
1,505
The theory and practice of corporate finance: Evidence from the field
 Journal of Financial Economics
, 2001
"... We survey 392 CFOs about the cost of capital, capital budgeting, and capital structure. Large firms rely heavily on present value techniques and the capital asset pricing model, while small firms are relatively likely to use the payback criterion. We find that a surprising number of firms use their ..."
Abstract

Cited by 725 (23 self)
 Add to MetaCart
order and tradeoff capital structure hypotheses but little evidence that executives are concerned about asset substitution, asymmetric information, transactions costs, free cash flows, or personal taxes. Key words: capital structure, cost of capital, cost of equity, capital budgeting, discount rates, project
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression
An Aprioribased Algorithm for Mining Frequent Substructures from Graph Data
, 2000
"... This paper proposes a novel approach named AGM to efficiently mine the association rules among the frequently appearing substructures in a given graph data set. A graph transaction is represented by an adjacency matrix, and the frequent patterns appearing in the matrices are mined through the exte ..."
Abstract

Cited by 310 (7 self)
 Add to MetaCart
This paper proposes a novel approach named AGM to efficiently mine the association rules among the frequently appearing substructures in a given graph data set. A graph transaction is represented by an adjacency matrix, and the frequent patterns appearing in the matrices are mined through
A Global Map of Science Based on the ISI Subject Categories
, 2007
"... The ISI subject categories classify journals included in the Science Citation Index (SCI). The aggregated journaljournal citation matrix contained in the Journal Citation Reports can be aggregated on the basis of these categories. This leads to an asymmetrical transaction matrix (citing versus cite ..."
Abstract

Cited by 45 (11 self)
 Add to MetaCart
The ISI subject categories classify journals included in the Science Citation Index (SCI). The aggregated journaljournal citation matrix contained in the Journal Citation Reports can be aggregated on the basis of these categories. This leads to an asymmetrical transaction matrix (citing versus
A tree projection algorithm for generation of frequent itemsets
 Journal of Parallel and Distributed Computing
, 2000
"... In this paper we propose algorithms for generation of frequent itemsets by successive construction of the nodes of a lexicographic tree of itemsets. We discuss di erent strategies in generation and traversal of the lexicographic tree such as breadth rst search, depth rst search or a combination of ..."
Abstract

Cited by 192 (2 self)
 Add to MetaCart
of the two. These techniques provide di erent tradeo s in terms of the I/O, memory and computational time requirements. We use the hierarchical structure of the lexicographic tree to successively project transactions at each node of the lexicographic tree, and use matrix counting on this reduced set
Transactions
"... Estimation of the noncentrality matrix of a noncentral Wishart distribution with unit scale matrix. A matrix generalization of leung’s domination result Heinz Neudecker∗ Cesaro The main aim is to estimate the noncentrality matrix of a noncentral Wishart distribution. The method used is Leung’s but g ..."
Abstract
 Add to MetaCart
Estimation of the noncentrality matrix of a noncentral Wishart distribution with unit scale matrix. A matrix generalization of leung’s domination result Heinz Neudecker∗ Cesaro The main aim is to estimate the noncentrality matrix of a noncentral Wishart distribution. The method used is Leung’s
An Asymmetric Image Encryption Based on Matrix Transformation ", ecti transactions on computer and information technology vol.1, no.2
, 2005
"... In this paper, it is shown how to adapt certain matrix transformation to create a novel asymmetric block encryption scheme. The proposed scheme is especially useful for encryption of large amounts of data, such as digital images. First, a pair of keys are given by using matrix transformation; Second ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In this paper, it is shown how to adapt certain matrix transformation to create a novel asymmetric block encryption scheme. The proposed scheme is especially useful for encryption of large amounts of data, such as digital images. First, a pair of keys are given by using matrix transformation
SUBMITTED TO IEEE TRANSACTIONS ON SIGNAL PROCESSING 1 Approximate Joint Singular Value Decomposition of an Asymmetric Rectangular Matrix Set
"... Abstract—The singular value decomposition C = UΛVT is among the most useful and widespread tools in linear algebra. Often in engineering a multitude of matrices with common latent structure are available. Suppose we have a set of K matrices {C1,...,CK} for which we wish to find two orthogonal matric ..."
Abstract
 Add to MetaCart
Abstract—The singular value decomposition C = UΛVT is among the most useful and widespread tools in linear algebra. Often in engineering a multitude of matrices with common latent structure are available. Suppose we have a set of K matrices {C1,...,CK} for which we wish to find two orthogonal matrices U and V such that all products UT CkV are as close as possible to rectangular diagonal form. We show that the problem can be solved efficiently by iterating either power iterations followed by an orthogonalization process or Givens rotations. The two proposed algorithms can be seen as a generalization of approximate joint diagonalization (AJD) algorithms to the bilinear orthogonal forms. Indeed, if the input matrices are symmetric and U = V, the optimization problem reduces to that of orthogonal AJD. The effectiveness of the algorithms is shown with numerical simulations and the analysis of a large database of 84 electroencephalographic recordings. The proposed algorithms open the road to new applications of the blind source separation framework, of which we give some example for electroencephalographic data. Index Terms—bilinear orthogonal approximate joint diagonalization, singular value decomposition, Lödwin orthogonalization, power iteration, Jacobi iterations, Givens rotations I.
The asymmetric matrix partition problem
, 2012
"... An instance of the asymmetric matrix partition problem consists of a matrix A ∈ R n×m + and a probability distribution p over its columns. The goal is to find a partition scheme that maximizes the resulting partition value. A partition scheme S = {S1,..., Sn} consists of a partition Si of [m] for e ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
An instance of the asymmetric matrix partition problem consists of a matrix A ∈ R n×m + and a probability distribution p over its columns. The goal is to find a partition scheme that maximizes the resulting partition value. A partition scheme S = {S1,..., Sn} consists of a partition Si of [m
The Theory of Financial Intermediation
, 1996
"... : Traditional theories of intermediation are based on transaction costs and asymmetric information. They are designed to account for institutions which take deposits or issue insurance policies and channel funds to firms. However, in recent decades there have been significant changes. Although tr ..."
Abstract

Cited by 118 (18 self)
 Add to MetaCart
: Traditional theories of intermediation are based on transaction costs and asymmetric information. They are designed to account for institutions which take deposits or issue insurance policies and channel funds to firms. However, in recent decades there have been significant changes. Although
Results 1  10
of
1,505