Sciweavers

2606 search results - page 319 / 522
» cost 2008
Sort
View
TALG
2010
123views more  TALG 2010»
15 years 5 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina
TCOM
2010
112views more  TCOM 2010»
15 years 5 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
TIP
2010
188views more  TIP 2010»
15 years 5 months ago
On-line Learning of Mutually Orthogonal Subspaces for Face Recognition by Image Sets
—We address the problem of face recognition by matching image sets. Each set of face images is represented by a subspace (or linear manifold) and recognition is carried out by su...
Tae-Kyun Kim, Josef Kittler, Roberto Cipolla
TIP
2010
154views more  TIP 2010»
15 years 5 months ago
Projective Nonnegative Graph Embedding
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
Xiaobai Liu, Shuicheng Yan, Hai Jin
TKDE
2010
251views more  TKDE 2010»
15 years 5 months ago
Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...
Ben Kao, Sau Dan Lee, Foris K. F. Lee, David Wai-L...