1429 search results - page 234 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
100
click to vote
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Background knowledge is an important factor in privacy preserving data publishing. Probabilistic distributionbased background knowledge is a powerful kind of background knowledge w...
JMLR
2010
14 years 4 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
82
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
100
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
AIPS
2008
15 years 1 days ago
2008
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...