Sciweavers

1132 search results - page 18 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
COMSWARE
2007
IEEE
14 years 1 months ago
Sequence Design for Symbol-Asynchronous CDMA with Power or Rate Constraints
— Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound...
Jyothiram Kasturi, Rajesh Sundaresan
GECCO
2004
Springer
14 years 4 days ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 6 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
NIPS
2004
13 years 8 months ago
Variational Minimax Estimation of Discrete Distributions under KL Loss
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
Liam Paninski
GLOBECOM
2008
IEEE
13 years 6 months ago
On the Capacity of One-Sided Two User Gaussian Fading Broadcast Channels
In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Co...
Amin Jafarian, Sriram Vishwanath