Sciweavers

2569 search results - page 350 / 514
» Approximate Objects and Approximate Theories
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 8 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
IMC
2007
ACM
15 years 8 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
NIPS
2007
15 years 8 months ago
A neural network implementing optimal state estimation based on dynamic spike train decoding
It is becoming increasingly evident that organisms acting in uncertain dynamical environments often employ exact or approximate Bayesian statistical calculations in order to conti...
Omer Bobrowski, Ron Meir, Shy Shoham, Yonina C. El...
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
15 years 8 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
NIPS
1993
15 years 8 months ago
Convergence of Stochastic Iterative Dynamic Programming Algorithms
Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms,includ...
Tommi Jaakkola, Michael I. Jordan, Satinder P. Sin...