Sciweavers

416 search results - page 28 / 84
» Correcting a Space-Efficient Simulation Algorithm
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates
Abstract—Mobile TV networks have received significant attention from the industry and academia, as they have already been deployed in several countries and their expected market...
Cheng-Hsin Hsu, Mohamed Hefeeda
ICASSP
2008
IEEE
14 years 1 months ago
Compressed sensing - a look beyond linear programming
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...
Christian R. Berger, Javier Areta, Krishna R. Patt...
CORR
2006
Springer
136views Education» more  CORR 2006»
13 years 7 months ago
Bargaining over the interference channel
In this paper we study the computation of the Nash bargaining solution for the two players, K frequency bands case, under joint FDM/TDM spectrum allocations and total power constra...
Amir Leshem, Ephraim Zehavi
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
13 years 11 months ago
The Price of Resiliency: A Case Study on Sorting with Memory Faults
We address the problem of sorting in the presence of faults that may arbitrarily corrupt memory locations, and investigate the impact of memory faults both on the correctness and ...
Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe...
ANTSW
2010
Springer
13 years 5 months ago
Formal Verification of Probabilistic Swarm Behaviours
Robot swarms provide a way for a number of simple robots to work together to carry out a task. While swarms have been found to be adaptable, fault-tolerant and widely applicable, d...
Savas Konur, Clare Dixon, Michael Fisher