Sciweavers

278 search results - page 24 / 56
» Two Upper Bounds on the Chromatic Number
Sort
View
WINET
2008
86views more  WINET 2008»
13 years 8 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
ICC
2007
IEEE
14 years 2 months ago
Partial Decoding for Synchronous and Asynchronous Gaussian Multiple Relay Channels
— Relaying diversity is a key technology to increase capacity in wireless networks. In this paper, the capacity of a single source-destination wireless channel, aided by a set of...
Aitor del Coso, Christian Ibars
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 1 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 16 days ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
JSAC
2007
87views more  JSAC 2007»
13 years 8 months ago
Scheduling of Multi-Antenna Broadcast Systems with Heterogeneous Users
— We consider a two transmit antenna broadcast system with heterogeneous users, and tackle the problem of maximizing a weighted sum rate. We establish a novel upper bound for the...
Krishna P. Jagannathan, Sem C. Borst, Philip A. Wh...