Sciweavers

79 search results - page 5 / 16
» On the Average Number of States of Partial Derivative Automa...
Sort
View
ICALP
2001
Springer
13 years 12 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
ICW
2005
IEEE
130views Communications» more  ICW 2005»
14 years 29 days ago
A Finite-State Markov Chain Model for Statistical Loss Across a RED Queue
Abstract— In this paper, we present an analytical study targeted at statistically capturing the loss behavior of a RED queue. We utilize a finite-state Markov chain model. Start...
Mohit B. Singh, Homayoun Yousefi'zadeh, Hamid Jafa...
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 7 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 7 months ago
Multiple Access Channels with State Information Known at Some Encoders
We consider a multiple access channel (MAC) with channel state information (CSI) non-causally known at some encoders. For simplicity of exposition, we focus on a two-encoder model...
Shivaprasad Kotagiri, J. Nicholas Laneman
TCOM
2011
151views more  TCOM 2011»
13 years 2 months ago
Multi-Mode Transmission for the MIMO Broadcast Channel with Imperfect Channel State Information
This paper proposes an adaptive multi-mode transmission strategy to improve the spectral efficiency achieved in the multiple-input multiple-output (MIMO) broadcast channel with d...
Jun Zhang, Marios Kountouris, Jeffrey G. Andrews, ...