Sciweavers

198 search results - page 23 / 40
» On Extremal Cases of Hopcroft's Algorithm
Sort
View
GLOBECOM
2008
IEEE
13 years 9 months ago
User Selection for Multiple-Antenna Broadcast Channel with Zero-Forcing Beamforming
Abstract—This paper investigates the zero-forcing (ZF) beamforming transmit strategy in the multiple-antenna multiuser downlink systems. We consider the case of mobile users equi...
Saeed Kaviani, Witold A. Krzymien
DLS
2009
150views Languages» more  DLS 2009»
13 years 6 months ago
Fast type reconstruction for dynamically typed programming languages
Type inference and type reconstruction derive static types for program elements that have no static type associated with them. They have a wide range of usage, such as helping to ...
Frédéric Pluquet, Antoine Marot, Roe...
CORR
2006
Springer
154views Education» more  CORR 2006»
13 years 8 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
BMCBI
2008
153views more  BMCBI 2008»
13 years 8 months ago
Estimating the size of the solution space of metabolic networks
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
Alfredo Braunstein, Roberto Mulet, Andrea Pagnani
SIGECOM
2009
ACM
100views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
The price of uncertainty
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...
Maria-Florina Balcan, Avrim Blum, Yishay Mansour