Sciweavers

824 search results - page 23 / 165
» Weighted Low-Rank Approximations
Sort
View
170
Voted
WG
2004
Springer
15 years 7 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern
ICALP
2009
Springer
16 years 2 months ago
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
TREC
2008
15 years 3 months ago
Weighted PageRank: Cluster-Related Weights
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...
Danil Nemirovsky, Konstantin Avrachenkov
CVPR
2007
IEEE
16 years 3 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...
ICB
2007
Springer
188views Biometrics» more  ICB 2007»
15 years 3 months ago
Color Face Tensor Factorization and Slicing for Illumination-Robust Recognition
In this paper we present a face recognition method based on multiway analysis of color face images, which is robust to varying illumination conditions. Illumination changes cause l...
Yong-Deok Kim, Seungjin Choi