Sciweavers

9842 search results - page 1880 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICC
2007
IEEE
14 years 2 months ago
Design of Single-Group Multicasting-Beamformers
— For the single-group multicast scenario, where K users are served with the same data by a base station equipped with N antennas, we present two beamforming algorithms which out...
Raphael Hunger, David A. Schmidt, Michael Joham, A...
INFOCOM
2007
IEEE
14 years 2 months ago
Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
David Starobinski, Weiyao Xiao, Xiangping Qin, Ari...
IPPS
2007
IEEE
14 years 2 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
LANOMS
2007
IEEE
172views Education» more  LANOMS 2007»
14 years 2 months ago
Implementing and Deploying Network Monitoring Service Oriented Architectures
—Recently there is a growing interest in accessing network measurement and status data across multiple domains, in order to detect eventual network problems which can hinder the ...
Leobino Nascimento Sampaio, Ivo Koga, Rafael Costa...
ASIACRYPT
2007
Springer
14 years 1 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
« Prev « First page 1880 / 1969 Last » Next »