Sciweavers

806 search results - page 2 / 162
» Lower Bounds on Correction Networks
Sort
View
TMC
2011
131views more  TMC 2011»
13 years 29 days ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 6 months ago
On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm...
K. Prasad, B. Sundar Rajan
COLT
2003
Springer
13 years 11 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
IWANN
1997
Springer
13 years 10 months ago
Lower Bounds of Computational Power of a Synaptic Calculus
João Pedro Guerreiro Neto, José F&ea...