380 search results - page 60 / 76 » Projective Least-Squares: Global Solutions with Local Optimi... |
118
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
CEC
2010
IEEE
14 years 11 months ago
2010
IEEE
A key feature in population based optimization algorithms is the ability to explore a search space and make a decision based on multiple solutions. In this paper, an incremental le...
100
click to vote
JSAC
2010
14 years 8 months ago
2010
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
We study the problem of localizing repair packets when packets are lost. When repair packets are multicasted, a highly lossy receiver may swamp the entire multicast “group” wi...