Sciweavers

244 search results - page 38 / 49
» Compressive PCA on Graphs
Sort
View
PVLDB
2008
122views more  PVLDB 2008»
13 years 10 months ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor
IANDC
2008
141views more  IANDC 2008»
13 years 11 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
CIKM
2005
Springer
14 years 4 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
CVPR
2010
IEEE
14 years 7 months ago
Model Evolution: An Incremental Approach to Non-Rigid Structure from Motion
In this paper, we present a new framework for non-rigid structure from motion (NRSFM) that simultaneously addresses three significant challenges: severe occlusion, perspective ca...
Shengqi Zhu, Li Zhang, Brandon Smith
ICDM
2008
IEEE
108views Data Mining» more  ICDM 2008»
14 years 5 months ago
Non-negative Matrix Factorization on Manifold
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
Deng Cai, Xiaofei He, Xiaoyun Wu, Jiawei Han