Sciweavers

376 search results - page 39 / 76
» Betweenness Centrality : Algorithms and Lower Bounds
Sort
View
ET
2010
89views more  ET 2010»
14 years 10 months ago
On the Duality of Probing and Fault Attacks
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
Berndt M. Gammel, Stefan Mangard
CORR
2011
Springer
200views Education» more  CORR 2011»
14 years 6 months ago
Optimal Channel Training in Uplink Network MIMO Systems
We consider a multi-cell frequency-selective fading uplink channel (network MIMO) from K singleantenna user terminals (UTs) to B cooperative base stations (BSs) with M antennas ea...
Jakob Hoydis, Mari Kobayashi, Mérouane Debb...
INFOCOM
2011
IEEE
14 years 3 months ago
User-centric data dissemination in disruption tolerant networks
Abstract—Data dissemination is useful for many applications of Disruption Tolerant Networks (DTNs). Current data dissemination schemes are generally network-centric ignoring user...
Wei Gao, Guohong Cao
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
15 years 1 months ago
Improved Rounding for Parallel Repeated Unique Games
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
David Steurer
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 12 days ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb