Sciweavers

1804 search results - page 64 / 361
» Ranking for data repairs
Sort
View
ICCV
2011
IEEE
13 years 12 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
3DIM
2007
IEEE
15 years 6 months ago
Image-based Model Completion
Geometric models created from range sensors are usually incomplete. Considerable effort has been made to fix this problem, ranging from manual repairing to geometric interpolatio...
Alan Brunton, Stefanie Wuhrer, Chang Shu
IRI
2007
IEEE
15 years 6 months ago
Acronym-Expansion Recognition and Ranking on the Web
The paper presents a study on large-scale automatic extraction of acronyms and associated expansions from Web data and from the user interactions with this data through Web search...
Alpa Jain, Silviu Cucerzan, Saliha Azzam
CVPR
2012
IEEE
13 years 2 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
WWW
2006
ACM
16 years 16 days ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing