Sciweavers

732 search results - page 136 / 147
» corr 2011
Sort
View
CORR
2011
Springer
171views Education» more  CORR 2011»
14 years 10 months ago
Fairness issues in a chain of IEEE 802.11 stations
: We study a simple general scenario of ad hoc networks based on IEEE 802.11 wireless communications, consisting in a chain of transmitters, each of them being in the carrier sense...
Bertrand Ducourthial, Yacine Khaled, Stépha...
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 10 months ago
Kron Reduction of Graphs with Applications to Electrical Networks
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
Florian Dörfler, Francesco Bullo
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 7 months ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman
150
Voted
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 7 months ago
Quadratic Goldreich-Levin Theorems
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
Madhur Tulsiani, Julia Wolf
145
Voted
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 6 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...