Results 1  10
of
52,325
TurboSMT: Accelerating Coupled Sparse MatrixTensor Factorizations by 200x
"... How can we correlate the neural activity in the human brain as it responds to typed words, with properties of these terms (like ’edible’, ’fits in hand’)? In short, we want to find latent variables, that jointly explain both the brain activity, as well as the behavioral responses. This is one of man ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of many settings of the Coupled MatrixTensor Factorization (CMTF) problem. Can we accelerate any CMTF solver, so that it runs within a few minutes instead of tens of hours to a day, while maintaining good accuracy? We introduce TurboSMT, a metamethod capable of doing exactly that: it boosts
Nonconvex Statistical Optimization for Sparse Tensor Graphical Model
"... We consider the estimation of sparse graphical models that characterize the dependency structure of highdimensional tensorvalued data. To facilitate the estimation of the precision matrix corresponding to each way of the tensor, we assume the data follow a tensor normal distribution whose covaria ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
covariance has a Kronecker product structure. The penalized maximum likelihood estimation of this model involves minimizing a nonconvex objective function. In spite of the nonconvexity of this estimation problem, we prove that an alternating minimization algorithm, which iteratively estimates each sparse
FOCK SPACE TECHNIQUES IN TENSOR ALGEBRAS OF DIRECTED GRAPHS
"... Abstract. In [MS1], Muhly and Solel developed a theory of tensor algebras over Ccorrespondences that extends the model theory of contractions in B (H) : The main examples are generated by Fock spaces, directed graphs, and analytic cross products. In this paper we show that many results of tensor a ..."
Abstract
 Add to MetaCart
Abstract. In [MS1], Muhly and Solel developed a theory of tensor algebras over Ccorrespondences that extends the model theory of contractions in B (H) : The main examples are generated by Fock spaces, directed graphs, and analytic cross products. In this paper we show that many results of tensor
Biographical Sketch
, 1999
"... Finding appropriate transfer functions for direct volume rendering is a dicult problem because of the large amount of user experimentation typically involved. Ideally, the dataset being rendered should itself be able to suggest a transfer function which makes the important structures visible. We de ..."
Abstract
 Add to MetaCart
Finding appropriate transfer functions for direct volume rendering is a dicult problem because of the large amount of user experimentation typically involved. Ideally, the dataset being rendered should itself be able to suggest a transfer function which makes the important structures visible. We demonstrate that this is possible for a large class of scalar volume data, namely that where the region of interest is the boundary between dierent materials. A transfer function which makes boundaries readily visible can be generated from the relationship between three quantities: the data value and its rst and second directional derivatives along the gradient direction. A data structure we term the histogram volume captures the relationship between these quantities throughout the volume in a position independent, computationally ecient fashion. We describe the theoretical importance of the quantities measured by the histogram volume, the implementation issues in its calculation, and a method for semiautomatic transfer function generation through its analysis. The techniques presented here make direct volume rendering easier to use, not only because there are much fewer variables for the user to adjust to nd an informative rendering, but because using them is more intuitive then current interfaces for transfer function specication. Furthermore, the results are derived solely from the original dataset and its inherent patterns of values, without the introduction of any articial structures or limitations. Examples with volume datasets from a variety of disciplines illustrate the generality and strength of the techniques.
Biographical Sketch
, 2014
"... of Rochester in 2009 under the direction of Professor Chen Ding. He did a summer internship at AMD in 2011. Since the summer of 2012, he has been a fulltime software engineer at Azul Systems. Much of this dissertation is from the following four workshops and conference papers on optimal collaborati ..."
Abstract
 Add to MetaCart
of Rochester in 2009 under the direction of Professor Chen Ding. He did a summer internship at AMD in 2011. Since the summer of 2012, he has been a fulltime software engineer at Azul Systems. Much of this dissertation is from the following four workshops and conference papers on optimal collaborative caching:
BIOGRAPHICAL SKETCH
, 2005
"... We have searched for the dipion transition Â0b! Âb + ¡ in the CLEOIII sample of ¨(3S) decays in the exclusive decay chain, ¨(3S)! °Â0b, Â 0 b! Âb ..."
Abstract
 Add to MetaCart
We have searched for the dipion transition Â0b! Âb + ¡ in the CLEOIII sample of ¨(3S) decays in the exclusive decay chain, ¨(3S)! °Â0b, Â 0 b! Âb
Results 1  10
of
52,325