Sciweavers

CORR
2010
Springer
338views Education» more  CORR 2010»
13 years 8 months ago
Optimal Distributed P2P Streaming under Node Degree Bounds
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
Shaoquan Zhang, Ziyu Shao, Minghua Chen
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 8 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 8 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 8 months ago
On Maximizing Coverage in Gaussian Relay Networks
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspecti...
Vaneet Aggarwal, Amir Bennatan, A. Robert Calderba...
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 8 months ago
General Model for Single and Multiple Channels WLANs with Quality of Service Support
In this paper we develop an intergraded model for request mechanism and data transmission in the uplink phase in the presence of channel noise. This model supports quality of serv...
Abdelsalam B. Amer, Fayez Gebali
CORR
2008
Springer
69views Education» more  CORR 2008»
13 years 8 months ago
Compressed Counting
Ping Li
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 8 months ago
Digraph Decompositions and Monotonicity in Digraph Searching
Abstract. We consider graph searching games on directed graphs and corresponding digraph decompositions. In particular we show that two important variants of these games
Stephan Kreutzer, Sebastian Ordyniak
CORR
2008
Springer
58views Education» more  CORR 2008»
13 years 8 months ago
Reconstruction of eye movements during blinks
Murilo S. Baptista, Christiane Bohn, Reinhold Klie...
CORR
2008
Springer
217views Education» more  CORR 2008»
13 years 8 months ago
A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks
Abstract-- This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge ...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
CORR
2008
Springer
101views Education» more  CORR 2008»
13 years 8 months ago
Choice numbers of graphs
Shai Gutner