Sciweavers

1746 search results - page 77 / 350
» Recent Developments in Algorithmic Teaching
Sort
View
TCS
2010
13 years 7 months ago
Towards practical feasibility of core computation in data exchange
Abstract. Core computation in data exchange is concerned with materializing the minimal target database for a given source database. Gottlob and Nash have recently shown that the c...
Reinhard Pichler, Vadim Savenkov
ICASSP
2011
IEEE
13 years 29 days ago
Sparsity-undersampling tradeoff of compressed sensing in the complex domain
In this paper, recently developed ONE-L1 algorithms for compressed sensing are applied to complex-valued signals and sampling matrices. The optimal and iterative solution of ONE-L...
Zai Yang, Cishen Zhang
JMLR
2012
11 years 11 months ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola
IPPS
1998
IEEE
14 years 1 months ago
Deterministic Routing of h-relations on the Multibutterfly
In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N-input/output multibutterfly. The algorithm, which is obtained by generalizing th...
Andrea Pietracaprina
NIPS
2004
13 years 10 months ago
Brain Inspired Reinforcement Learning
Successful application of reinforcement learning algorithms often involves considerable hand-crafting of the necessary non-linear features to reduce the complexity of the value fu...
François Rivest, Yoshua Bengio, John Kalask...