Results 41 to 50 of about 6,618,541 (298)

TURBO: The Swiss Knife of Auto-Encoders

open access: yesEntropy, 2023
We present a novel information-theoretic framework, termed as TURBO, designed to systematically analyse and generalise auto-encoding methods. We start by examining the principles of information bottleneck and bottleneck-based networks in the auto ...
Guillaume Quétant   +3 more
doaj   +1 more source

Lower Bounds for Approximate LDCs [PDF]

open access: yes, 2014
We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(α,δ)$-approximate LDC is a set $V$ of $n$ points in $\mathbb{R}^d$ so that, for each $i \in [d]$ there are $Ω(δn)$ disjoint $q$-tuples $(\vec{u}_1,\ldots,\vec{u}_q) $ in $V$ so that
J. Briët (Jop)   +3 more
openaire   +5 more sources

An Improved Interval Fuzzy Modeling Method: Applications to the Estimation of Photovoltaic/Wind/Battery Power in Renewable Energy Systems

open access: yesEnergies, 2018
This paper proposes an improved interval fuzzy modeling (imIFML) technique based on modified linear programming and actual boundary points of data. The imIFML technique comprises four design stages. The first stage is based on conventional interval fuzzy
Nguyen Gia Minh Thao, Kenko Uchida
doaj   +1 more source

Treewidth Lower Bounds with Brambles [PDF]

open access: yesAlgorithmica, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender   +2 more
openaire   +7 more sources

An Evaluation of Mathematical Programming and Lower-Bound Methods for Hybrid Flow Shop Problems With a Makespan Criterion

open access: yesIEEE Access, 2023
This paper considers the hybrid flow shop scheduling problem, where jobs are processed in $m$ stages with the same route of the stage. Each stage has identical parallel machines for processing jobs.
Yarong Chen, Ya-Chih Tsai, Fuh-Der Chou
doaj   +1 more source

A Lower Bound for Scheduling Mechanisms [PDF]

open access: yesAlgorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George Christodoulou 0001   +2 more
openaire   +8 more sources

The Gilbert-Varshamov Bound for Stabilizer Codes Over $\mathbb{Z}_m$

open access: yesIEEE Access, 2018
Quantum codes over finite rings have received a great deal of attention in recent years. Compared with quantum codes over finite fields, a notable advantage of quantum codes over finite rings is that they can adapt to quantum physical systems of ...
Nianqi Tang   +3 more
doaj   +1 more source

Bridging the Loneliness Gap: Depression, Connectivity, and Isolation in Pediatric Oncology Patients and Their Peers

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Loneliness is associated with adverse physical and mental health outcomes and remains understudied in children and adolescents undergoing cancer therapy. Pediatric oncology patients may be at increased risk due to medical isolation and disruption of social networks.
Charlotte N. Stahlfeld   +5 more
wiley   +1 more source

Bounding Strategies for the Parallel Processors Scheduling Problem With No-Idle Time Constraint, Release Date, and Delivery Time

open access: yesIEEE Access, 2019
The identical parallel processors scheduling problem with no-idle time, release date, and delivery time is addressed in this paper. The problem considers a family of tasks that has to be processed by identical parallel processors without idle time.
Lotfi Hidri   +2 more
doaj   +1 more source

Circuit lower bounds in bounded arithmetics

open access: yesAnnals of Pure and Applied Logic, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +5 more sources

Home - About - Disclaimer - Privacy