526 search results - page 76 / 106 » On circularly symmetric functions |
176
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
215
click to vote
SIAMSC
2011
15 years 1 months ago
2011
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
190
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
168
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
161
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...