Sciweavers

2095 search results - page 49 / 419
» Improved pebbling bounds
Sort
View
ADHOCNOW
2008
Springer
13 years 11 months ago
A Lower Bound on the Capacity of Wireless Ad Hoc Networks with Cooperating Nodes
In this paper, we consider the effects on network capacity when the nodes of an ad hoc network are allowed to cooperate. These results are then compared to the theoretical upper b...
Anthony S. Acampora, Louisa Pui Sum Ip
GLVLSI
2000
IEEE
104views VLSI» more  GLVLSI 2000»
14 years 2 months ago
A new technique for estimating lower bounds on latency for high level synthesis
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...
Helvio P. Peixoto, Margarida F. Jacome
COLT
2000
Springer
14 years 2 months ago
Estimation and Approximation Bounds for Gradient-Based Reinforcement Learning
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process (  ¢¡¤£¦¥§  ), and focus on gradient ascent approache...
Peter L. Bartlett, Jonathan Baxter
CISS
2008
IEEE
13 years 12 months ago
Outer bound and noisy-interference sum-rate capacity for symmetric Gaussian interference channels
A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-r...
Xiaohu Shang, Gerhard Kramer, Biao Chen
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 10 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar