1449 search results - page 76 / 290 » Self-Randomized Exponentiation Algorithms |
159
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
175
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
A number of updates for density matrices have been developed recently that are motivated by relative entropy minimization problems. The updates involve a softmin calculation based...
152
click to vote
SDM
2004
SIAM
15 years 7 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
182
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
228
click to vote
EUROCOLT
1999
Springer
15 years 10 months ago
1999
Springer
We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...