Sciweavers

411 search results - page 25 / 83
» Rank Estimation in Missing Data Matrix Problems
Sort
View
RECOMB
2005
Springer
14 years 8 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
AUTOMATICA
2006
87views more  AUTOMATICA 2006»
13 years 7 months ago
Modeling continuous-time processes via input-to-state filters
A direct algorithm to estimate continuous-time ARMA (CARMA) models is proposed in this paper. In this approach, we first pass the observed data through an input-to-state filter an...
Kaushik Mahata, Minyue Fu
ICDM
2010
IEEE
146views Data Mining» more  ICDM 2010»
13 years 5 months ago
One-Class Matrix Completion with Low-Density Factorizations
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...
Vikas Sindhwani, Serhat Selcuk Bucak, Jianying Hu,...
ICCV
2003
IEEE
14 years 9 months ago
Image Registration with Global and Local Luminance Alignment
Inspired by tensor voting, we present luminance voting, a novel approach for image registration with global and local luminance alignment. The key to our modeless approach is the ...
Jiaya Jia, Chi-Keung Tang
ICCV
2011
IEEE
12 years 7 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan