-
15841
Clotting Mimicry from Robust Hemostatic Bandages Based on Self-Assembling Peptides
Published 2016Get full text
Article -
15842
-
15843
-
15844
-
15845
Searching without communicating: tradeoffs between performance and selection complexity
Published 2021“…In more detail, we propose a new selection complexity metric χ, defined for algorithm A such that χ(A) = b+ log ℓ, where b is the number of memory bits used by each agent and ℓ bounds the fineness of available probabilities (agents use probabilities of at least 1 / 2 ℓ). …”
Get full text
Article -
15846
The orthogonal vectors conjecture for branching programs and formulas
Published 2021“…We give a sense in which independent random restrictions cannot be used to show hardness, in that OVC is false in the “average case” even for AC0 formulas: For all p ∈ (0, 1) there is a δp > 0 such that for every n and d, OV instances with input bits independently set to 1 with probability p (and 0 otherwise) can be solved with AC0 formulas of O(n2−δp ) size, on all but a on(1) fraction of instances. …”
Get full text
Article -
15847
-
15848
-
15849
-
15850
Advances in signatures, encryption, and E-Cash from bilinear groups
Published 2007Get full text
Thesis -
15851
-
15852
-
15853
-
15854
-
15855
-
15856
Spintronics based random access memory : a review
Published 2021“…Reading information from MRAM, the technologies, materials and the physics behind reading of bits in MRAM are described in detail. As a next step, the physics and technologies involved in writing information are described. …”
Get full text
Journal Article -
15857
Beamforming strategies in wireless multi-antenna communication systems
Published 2016“…The CS measurement is modelled as a quantization procedure in which quantization noises are generated according to the number of feedback bits. The original channel can be recovered with high accuracy by solving an optimization problem at the BS. …”
Get full text
Thesis -
15858
Correlation in hard distributions in communication complexity
Published 2018“…The upper bounds improve and generalise what was known for product distributions, and imply that any tight bound for Disjointness needs Omega(n) bits of mutual information in the corresponding distribution. - We study the same question in the distributional quantum setting, and show a lower bound of Omega((n(k+1))^{1/4}), and an upper bound (via constructing communication protocols), matching up to a logarithmic factor. - We show that there are total Boolean functions f_d that have distributional communication complexity O(log(n)) under all distributions of information up to o(n), while the (interactive) distributional complexity maximised over all distributions is Theta(log(d)) for n <= d <= 2^{n/100}. …”
Get full text
Get full text
Journal Article -
15859
Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure
Published 2013“…The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a d O(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is constant. …”
Get full text
Get full text
Conference Paper -
15860