Filters

17 Hits in 1.1 sec

### Soft Subexponentials and Multiplexing [chapter]

Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov
2020 Lecture Notes in Computer Science
One of the subexponentials allows the multiplexing rule in the style of soft linear logic and light linear logic. The second subexponential provides the exchange rule.  ...  Examples of such refinements are subexponentials, light linear logic, and soft linear logic. We bring together these refinements of linear logic in a non-commutative setting.  ...  and ∇; soft linear logic, which contributes a version of the multiplexing rule, ! L , shown below to the left; and light linear logic, which contributes the two right subexponentials rules, !  ...

### Vector Space Semantics for Lambek Calculus with Soft Subexponentials [article]

2021 arXiv   pre-print
We develop a vector space semantics for Lambek Calculus with Soft Subexponentials, apply the calculus to construct compositional vector interpretations for parasitic gap noun phrases and discourse units  ...  with anaphora and ellipsis, and experiment with the constructions in a distributional sentence similarity task.  ...  Formulas and rules of SLLM. Where 1 ≤ n ≤ k0. SLLM, Lambek Calculus with Soft Subexponentials SLLM is a cut-free logic with a decidable fragment and a directed proof system.  ...

### Compressive Multiplexing of Correlated Signals [article]

Ali Ahmed, Justin Romberg
2018 arXiv   pre-print
The signals are multiplexed onto a single line by mixing each one against a different code and then adding them together, and the resulting signal is sampled at a high rate.  ...  It is shown in Lemma 7 that product X of two subgaussian random variables X 1 , and X 2 is subexponential and X ψ 1 ≤ c X 1 ψ 2 X 2 ψ 2 .  ...  The signals are multiplexed onto fewer channels and then acquired using ADCs.  ...

### Feedback-aided complexity reductions in ML and lattice decoding

Arun Singh, Petros Elia
2012 2012 IEEE International Symposium on Information Theory Proceedings
Finally the derived savings are met by practically constructed ARQ schemes, as well as simple lattice designs, decoders, and computation-halting policies.  ...  Specifically we derive upper bounds on the feedback-aided complexity exponent required for the broad families of ML-based and lattice based decoders to achieve the optimal diversitymultiplexing behavior  ...  a subexponential function of the number of codeword bits and of the rate.  ...

Alan T. Murray, Steven R. Weller
2009 2009 Australian Communications Theory Workshop
In this paper, we review Adaptive Lattice Reduction and examine the performance and complexity of this detection scheme in both temporally and frequency fading channels.  ...  This particular detector was chosen due to its ability to produce a candidate list suitable for generating soft information and close to ML performance.  ...  Some detectors, such as sphere detectors, typically have complexity subexponentially proportional to the constellation set size and number of antennas and whilst their complexity is 978-1-4244-3357-5/09  ...

### Impulsive noise modeling and robust receiver design

Laurent Clavier, Gareth W. Peters, François Septier, Ido Nevat
2021 EURASIP Journal on Wireless Communications and Networking
We propose a framework to design receivers robust to a variety of interference types, both Gaussian and non-Gaussian.  ...  It has been shown in many situations that the popular Gaussian approximation is not adequate and interference exhibits an impulsive behavior.  ...  long-tailed and therefore an admissible sub-family of the subexponential impulsive interference models.  ...

### Demonstration of quantum advantage in machine learning

Diego Ristè, Marcus P. da Silva, Colm A. Ryan, Andrew W. Cross, Antonio D. Córcoles, John A. Smolin, Jay M. Gambetta, Jerry M. Chow, Blake R. Johnson
2017 npj Quantum Information
, and superconducting circuits.  ...  We find that this gap grows by orders of magnitude as a function of the error rates and the problem size.  ...  We consider different error rate for the ancilla and the data qubits. Postselected soft averaging.  ...

### Scale-free networks well done

Ivan Voitalov, Pim van der Hoorn, Remco van der Hofstad, Dmitri Krioukov
2019 Physical Review Research
Finally, we apply these estimators to a representative collection of synthetic and real-world data.  ...  We first provide a rigorous definition of power-law distributions, equivalent to the definition of regularly varying distributions that are widely used in statistics and other fields.  ...  However, in more complicated situations, such as directed, multipartite, multilayer, multiplex, and/or temporal networks, there are not one but many degree sequences associated with the network.  ...

### Strong ensemble nonequivalence in systems with local constraints [article]

Qi Zhang, Diego Garlaschelli
2021 arXiv   pre-print
This novel, simultaneously 'strong and unrestricted' form of nonequivalence is very robust and imposes a principled choice of the ensemble.  ...  The asymptotic equivalence of canonical and microcanonical ensembles is a central concept in statistical physics, with important consequences for both theoretical research and practical applications.  ...  the Chinese Scholarship Council (No. 201606990001), the Dutch Econophysics Foundation (Stichting Econophysics, Leiden, the Netherlands), the Netherlands Organization for Scientific Research (NWO/OCW) and  ...

### Page 1377 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews
(with Mordeson, John N.) *& Fuzzy graphs and fuzzy hypergraphs. (English summary) With a foreword by Paul P. Wang. Studies in Fuzziness and Soft Computing, 46.  ...  Asymptotic behavior of a multiplexer fed by a long-range dependent process. (English summary) J. Appl. Probab. 36 (1999), no. 1, 105-118.  ...

### Chemical and photochemical error rates in light-directed synthesis of complex DNA libraries

Jory Lietard, Adrien Leger, Yaniv Erlich, Norah Sadowski, Winston Timp, Mark M Somoza
2021 Nucleic Acids Research
reflections and chart the dependence of error rate on both position on the array and position within individual oligonucleotides.  ...  In this study, we look at the error rate of DNA libraries synthesized by photolithography and dissect the proportion of deletion, insertion and substitution errors.  ...  This could be a consequence of lower synthesis error but it is more likely the result of alignment soft-clipping.  ...

### Normal approximations for fading channels

Alejandro Lancho, Tobias Koch, Giuseppe Durisi
2018 2018 52nd Annual Conference on Information Sciences and Systems (CISS)
Error Exponent Analysis The expansions (6.49b) and (6.52) can be written as an exponential term times a subexponential factor.  ...  Setting s L = 1/(1 + τ L ) in (6.100), and analyzing the resulting expression as L → ∞, we will obtain not only the correct exponential behavior, but we will also obtain a positive subexponential term.  ...  Furthermore, by (6.108) and (6.109), both τ ↦ → ψ ′′ ρ,s (τ ) and τ ↦ → Ψ ρ,s (τ ) are bounded away from zero in (τ, s, ρ).  ...

### Structured sensing for estimation of high-dimensional data

Peng Zhang, Cong Ling, Technology Singapore. Agency For Science
2017
Efficient estimation and processing of high-dimensional data is important in many scientic and engineering domains.  ...  By leveraging the intrinsic information of the channel matrix through atomic norm, we propose new algorithms and demonstrate their performances for both channel estimation and faulty antennas detection  ...  multiplexing (OFDM) systems.  ...

### Computational Geometry (Dagstuhl Seminar 13101) Scheduling (Dagstuhl Seminar 13111) Future Internet (Dagstuhl Seminar 13131)

Otfried Cheong, Kurt Mehlhorn, Monique, Susanne Albers, Onno Boxma, Kirk, Erik Demaine, Fedor Fomin, Mohammadtaghi Hajiaghayi, Dimitrios, Jon Crowcroft, Markus Fidler (+2 others)
2013 unpublished
Another way to reduce latency in general is multiplexing resource usage across multiple resources, for example by requesting a web site from multiple servers and using the first response.  ...  Subexponential FPT Algorithms on Planar Graphs Dániel Marx, MTA, Budapest, dmarx@cs.bme.hu Is there a fixed-parameter algorithm with running time 2Õ ( √ k) n O(1) for the following problems?  ...  verification, and so forth. 13.  ...

### Part of the Computer Sciences Commons Recommended Citation Raman, Rajiv

Rajiv Raman, Rajiv Raman, Rajiv Raman, Samuel Burer, Suely Oliveira, Alberto Segre, Kasturi Varadarajan
2007 unpublished
The contributions of this thesis are : • The first constant factor approximation algorithms and complexity results for the max-coloring problem on bipartite graphs, interval graphs and an any hereditary  ...  In this thesis, we present several approximation algorithms and complexity results for such generalized coloring problems.  ...  These protocols stacks have stringent memory requirements as well as soft real-time constraints and a dedicated memory manager is a natural design choice.  ...
« Previous Showing results 1 — 15 out of 17 results