Sciweavers

2826 search results - page 138 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
CVPR
2007
IEEE
16 years 6 months ago
Element Rearrangement for Tensor-Based Subspace Learning
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
Shuicheng Yan, Dong Xu, Stephen Lin, Thomas S. Hua...
VIS
2004
IEEE
153views Visualization» more  VIS 2004»
16 years 5 months ago
Anisotropic Volume Rendering for Extremely Dense, Thin Line Data
Many large scale physics-based simulations which take place on PC clusters or supercomputers produce huge amounts of data including vector fields. While these vector data such as ...
Gregory L. Schussman, Kwan-Liu Ma
NIPS
1998
15 years 5 months ago
Learning Nonlinear Dynamical Systems Using an EM Algorithm
The Expectation Maximization EM algorithm is an iterative procedure for maximum likelihood parameter estimation from data sets with missing or hidden variables 2 . It has been app...
Zoubin Ghahramani, Sam T. Roweis
WEBI
2010
Springer
15 years 2 months ago
DSP: Robust Semi-supervised Dimensionality Reduction Using Dual Subspace Projections
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
Su Yan, Sofien Bouaziz, Dongwon Lee
BMCBI
2011
14 years 8 months ago
Proteinortho: Detection of (Co-)Orthologs in Large-Scale Analysis
Background: Orthology analysis is an important part of data analysis in many areas of bioinformatics such as comparative genomics and molecular phylogenetics. The ever-increasing ...
Marcus Lechner, Sven Findeiß, Lydia Steiner,...