Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
209
new algorithm to compute fusion coecients By
"... This is a proceedings article reviewing a recent combinatorial construction of the bsu(n)k WZNW fusion ring by C. Stroppel and the author. It contains one novel aspect: the explicit derivation of an algorithm for the computation of fusion coecients dierent from the Kac-Walton formula. The discussion ..."
Abstract
- Add to MetaCart
This is a proceedings article reviewing a recent combinatorial construction of the bsu(n)k WZNW fusion ring by C. Stroppel and the author. It contains one novel aspect: the explicit derivation of an algorithm for the computation of fusion coecients dierent from the Kac-Walton formula
Whom You Know Matters: Venture Capital Networks and Investment Performance,
- Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm's-length, spot-market transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract
-
Cited by 138 (8 self)
- Add to MetaCart
to make the concept of centrality more precise. 3 Consider the network illustrated in In graph theory, a network such as the one illustrated in 6 Networks are not static. Relationships may change, and entry to and exit from the network may change each actor's centrality. We therefore construct our
1Space-Time Physical-Layer Network Coding
"... Abstract—A space-time physical-layer network coding (ST-PNC) method is presented for information exchange among multiple users over fully-connected multi-way relay networks. The method involves two key steps: i) side-information learning and ii) space-time relay transmission. In the first phase of s ..."
Abstract
- Add to MetaCart
Abstract—A space-time physical-layer network coding (ST-PNC) method is presented for information exchange among multiple users over fully-connected multi-way relay networks. The method involves two key steps: i) side-information learning and ii) space-time relay transmission. In the first phase
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up- ..."
Abstract
- Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up-
Akademisk avhandling för teknisk doktorsexamen vid
, 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract
- Add to MetaCart
of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an n-path of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond
POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR
"... 2010 to my wife, Joyce, and my family...- Résumé- ..."
1On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying K-SVD
, 2013
"... This article gives theoretical insights into the performance of K-SVD, a dictionary learning algorithm that has gained significant popularity in practical applications. The particular question studied here is when a dictionary Φ ∈ Rd×K can be recovered as local minimum of the minimisation criterion ..."
Abstract
- Add to MetaCart
it is further demonstrated that given a finite number of training samples N, such that N / logN = O(K3d), except with probability O(N−Kd) there is a local minimum of the K-SVD criterion within distance O(KN−1/4) to the generating dictionary. Index Terms dictionary learning, sparse coding, K-SVD, finite sample
Results 1 - 10
of
209
