Sciweavers

1941 search results - page 24 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
GLOBECOM
2010
IEEE
13 years 4 months ago
Design of Amplify and Forward MIMO Relay Networks with QoS Constraint
In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...
Jafar Mohammadi, Feifei Gao, Yue Rong
NIPS
1997
13 years 8 months ago
Relative Loss Bounds for Multidimensional Regression Problems
We study on-line generalized linear regression with multidimensional outputs, i.e., neural networks with multiple output nodes but no hidden nodes. We allow at the final layer tra...
Jyrki Kivinen, Manfred K. Warmuth
HOTNETS
2010
13 years 2 months ago
A case for information-bound referencing
Links and content references form the foundation of the way that users interact today. Unfortunately, the links used today (URLs) are fragile since they tightly specify a protocol...
Ashok Anand, Aditya Akella, Vyas Sekar, Srinivasan...
FOCS
2005
IEEE
14 years 1 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
FSTTCS
2003
Springer
14 years 18 days ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh