Sciweavers

110 search results - page 6 / 22
» New Upper Bounds for Maximum Satisfiability
Sort
View
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 7 months ago
Capacity Regions and Bounds for a Class of Z-interference Channels
We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A ...
Nan Liu, Andrea J. Goldsmith
FSTTCS
2006
Springer
13 years 10 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
CISS
2008
IEEE
14 years 1 months ago
On optimal training and beamforming in uncorrelated MIMO systems with feedback
—This paper studies the design and analysis of optimal training-based beamforming in uncorrelated multipleinput multiple-output (MIMO) channels with known Gaussian statistics. Fi...
Francisco Rubio, Dongning Guo, Michael L. Honig, X...
COLT
2004
Springer
13 years 11 months ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
CN
2007
92views more  CN 2007»
13 years 7 months ago
A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to oï...
Jocelyne Elias, Fabio Martignon, Antonio Capone, G...