Sciweavers

411 search results - page 28 / 83
» Rank Estimation in Missing Data Matrix Problems
Sort
View
ICDE
2009
IEEE
251views Database» more  ICDE 2009»
14 years 9 months ago
Contextual Ranking of Keywords Using Click Data
The problem of automatically extracting the most interesting and relevant keyword phrases in a document has been studied extensively as it is crucial for a number of applications. ...
Utku Irmak, Vadim von Brzeski, Reiner Kraft
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 8 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
CVPR
2000
IEEE
14 years 9 months ago
A General Method for Errors-in-Variables Problems in Computer Vision
The Errors-in-Variables (EIV) model from statistics is often employed in computer vision thoughonlyrarely under this name. In an EIV model all the measurements are corrupted by no...
Bogdan Matei, Peter Meer
TSP
2010
13 years 2 months ago
Single antenna power measurements based direction finding
Abstract--In this paper, the problem of estimating direction-ofarrival (DOA) of multiple uncorrelated sources from single antenna power measurements is addressed. Utilizing the fac...
Joni Polili Lie, Thierry Blu, Chong Meng Samson Se...
ICASSP
2011
IEEE
12 years 11 months ago
Multiple kernel nonnegative matrix factorization
Kernel nonnegative matrix factorization (KNMF) is a recent kernel extension of NMF, where matrix factorization is carried out in a reproducing kernel Hilbert space (RKHS) with a f...
Shounan An, Jeong-Min Yun, Seungjin Choi