2740 search results - page 196 / 548 » Approximating Component Selection |
121
click to vote
SPIN
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
115
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
131
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...
113
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known discrete memoryless channel (DMC) ar...
126
Voted
IJON
2008
15 years 3 months ago
2008
Real-world data sets such as recordings from functional magnetic resonance imaging often possess both spatial and temporal structure. Here, we propose an algorithm including such ...