7006 search results - page 468 / 1402 » Approximation Algorithms |
160
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
154
click to vote
WINE
2007
Springer
16 years 8 days ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
149
click to vote
ICAI
2007
15 years 7 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
214
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
147
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...