Results 1  10
of
5,018
Coding Matrix
"... This paper describes the process for employing two principal instruments for relating the categories identifying the central phenomenon in grounded theory analysis. The Conditional Relationship Guide contextualizes the central phenomenon and relates structure with process. The second tool, the Refle ..."
Abstract
 Add to MetaCart
, the Reflective Coding Matrix, captures the higher level of abstraction necessary to bridge to the final phase of grounded theory analysis, selective coding and interpretation and ultimately to the theory generation. Examples of each instrument are provided and discussed. Key
Nonnegative matrix factorization with sparseness constraints,”
 Journal of Machine Learning Research,
, 2004
"... Abstract Nonnegative matrix factorization (NMF) is a recently developed technique for finding partsbased, linear representations of nonnegative data. Although it has successfully been applied in several applications, it does not always result in partsbased representations. In this paper, we sho ..."
Abstract

Cited by 498 (0 self)
 Add to MetaCart
Abstract Nonnegative matrix factorization (NMF) is a recently developed technique for finding partsbased, linear representations of nonnegative data. Although it has successfully been applied in several applications, it does not always result in partsbased representations. In this paper, we
Decoding by Linear Programming
, 2004
"... This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector f ∈ Rn from corrupted measurements y = Af + e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to rec ..."
Abstract

Cited by 1399 (16 self)
 Add to MetaCart
This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector f ∈ Rn from corrupted measurements y = Af + e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible
A Data Locality Optimizing Algorithm
, 1991
"... This paper proposes an algorithm that improves the locality of a loop nest by transforming the code via interchange, reversal, skewing and tiling. The loop transformation algorithm is based on two concepts: a mathematical formulation of reuse and locality, and a loop transformation theory that unifi ..."
Abstract

Cited by 804 (16 self)
 Add to MetaCart
that unifies the various transforms as unimodular matrix transformations. The algorithm has been implemented in the SUIF (Stanford University Intermediate Format) compiler, and is successful in optimizing codes such as matrix multiplication, successive overrelaxation (SOR), LU decomposition without pivoting
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
is the investigation of the relation between properties of a graph and the spectrum of its adjacency matrix. A central topic and important source of tools is the theory of association schemes. An association scheme is, roughly speaking, a collection of graphs on a common vertex set which fit together in a highly
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 495 (22 self)
 Add to MetaCart
interval of T symbol periods, after which they change to new independent values which they maintain for another T symbol periods, and so on. Computing the link capacity, associated with channel coding over multiple fading intervals, requires an optimization over the joint density of T M complex transmitted
Stable isotope labeling by amino acids in cell culture, SILAC, as a simple and accurate approach to expression proteomics
 Mol. Cell. Proteomics
, 2002
"... The abbreviations used are: SILAC: Stable isotope labeling by amino acids in cell culture, 2DE: two dimensional (isoelectric focusing/SDSPAGE) gel electrophoresis: ICATTM: isotopecoded affinity tag; MS: mass spectrometry; MALDITOF: matrix assisted laser desorption ionizationtime of flight; PMF: ..."
Abstract

Cited by 595 (23 self)
 Add to MetaCart
The abbreviations used are: SILAC: Stable isotope labeling by amino acids in cell culture, 2DE: two dimensional (isoelectric focusing/SDSPAGE) gel electrophoresis: ICATTM: isotopecoded affinity tag; MS: mass spectrometry; MALDITOF: matrix assisted laser desorption ionizationtime of flight; PMF
Online learning for matrix factorization and sparse coding
, 2010
"... Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statistics. This paper focuses on the largescale matrix factorization problem that consists of learning the basis set in order to ad ..."
Abstract

Cited by 330 (31 self)
 Add to MetaCart
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statistics. This paper focuses on the largescale matrix factorization problem that consists of learning the basis set in order
Linear multiuser detectors for synchronous codedivision multipleaccess channels
 IEEE TRANS. INFORM. THEORY
, 1989
"... In codedivision multipleaccess systems, simultaneous multiuser accessing of a common channel is made possible by assigning a signature waveform to each user. Knowledge of these waveforms enables the receiver to demodulate the data streams of each user, upon observation of the sum of the transmitt ..."
Abstract

Cited by 385 (4 self)
 Add to MetaCart
In codedivision multipleaccess systems, simultaneous multiuser accessing of a common channel is made possible by assigning a signature waveform to each user. Knowledge of these waveforms enables the receiver to demodulate the data streams of each user, upon observation of the sum
The benefits of coding over routing in a randomized setting
 In Proceedings of 2003 IEEE International Symposium on Information Theory
, 2003
"... Abstract — We present a novel randomized coding approach for robust, distributed transmission and compression of information in networks. We give a lower bound on the success probability of a random network code, based on the form of transfer matrix determinant polynomials, that is tighter than the ..."
Abstract

Cited by 361 (44 self)
 Add to MetaCart
Abstract — We present a novel randomized coding approach for robust, distributed transmission and compression of information in networks. We give a lower bound on the success probability of a random network code, based on the form of transfer matrix determinant polynomials, that is tighter than
Results 1  10
of
5,018