Results 41 to 50 of about 17,304 (236)

More dynamic data structures for geometric set cover with sublinear update time

open access: yesJournal of Computational Geometry, 2022
We study geometric set cover problems in dynamic settings, allowing insertions and deletions of points and objects. We present the first dynamic data structure that can maintain an $O(1)$-approximation in sublinear update time for set cover for axis ...
Timothy Chan, Qizheng He
doaj   +1 more source

Sublinear Partition Estimation

open access: yesCoRR, 2015
Preprint
Pushpendre Rastogi, Benjamin Van Durme
openaire   +2 more sources

Double phase problems with supercritical and sublinear growth

open access: yesElectronic Journal of Qualitative Theory of Differential Equations
In this work, our objective is to study the operators involving the nonstandard growth via variational methods. We first study a double phase problem having supercritical growth via minimization technique on convex sets. Alongside, the case of competing
Govind Kureel, Pawan Mishra
doaj   +1 more source

二阶次线性碰撞系统的次调和解(Subharmonic solutions for sublinear second order systems with impacts)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2012
We prove that there are infinite subharmonic bouncing solutions of sublinear second order systems x″+f(t, x)=0 when f(t, x) satisfies suitable condition in the around of x = 0.
MIAOXue-qing(缪雪晴), DINGWei(丁卫)
doaj   +1 more source

Precise Asymptotics in the Law of the Iterated Logarithm under Sublinear Expectations

open access: yesMathematical Problems in Engineering, 2021
By an inequality of partial sum and uniform convergence of the central limit theorem under sublinear expectations, we establish precise asymptotics in the law of the iterated logarithm for independent and identically distributed random variables under ...
Mingzhou Xu, K. Cheng
semanticscholar   +1 more source

Role of Quantum Coherence in Thermodynamics

open access: yesPRX Quantum, 2022
We find necessary and sufficient conditions to determine the interconvertibility of quantum systems under time-translation covariant evolution, and use it to solve several problems in quantum thermodynamics both in the single-shot and asymptotic regimes.
Gilad Gour
doaj   +1 more source

Mimicking Silent Synapse Recruitment: A SiOx/Cu‐Pancake Memristive Device For Analog Neuromorphic Computing

open access: yesAdvanced Functional Materials, EarlyView.
Electroforming‐free TiN/SiOx/Cu/SiOx/TiN memristive devices exploit pancake‐like Cu nanoparticles embedded in a SiOx double layer to create a heterogeneous Schottky‐barrier landscape. Under bias, oxygen‐vacancy redistribution progressively lowers local barriers and recruits initially inactive Cu‐PC pathways into a parallel conduction ensemble, enabling
Rouven Lamprecht   +10 more
wiley   +1 more source

Sublinear DTD Validity

open access: yes, 2015
We present an efficient algorithm for testing approximate DTD validity modulo the strong tree edit distance. Our algorithm inspects XML documents in a probabilistic manner. It detects with high probability the nonvalidity of XML documents with a large fraction of errors, measured in terms of the strong tree edit distance from the DTD.
Ndione, Antoine Mbaye   +2 more
openaire   +2 more sources

Interface‐Defect Synergy Engineering of Amorphous Ga2O3 for Voltage‐Tunable Dual‐Mode Optoelectronic Devices: Self‐Powered Imaging and Neuromorphic Vision

open access: yesAdvanced Functional Materials, EarlyView.
An interface‐defect co‐engineered strategy enables bias‐programmable integration of self‐powered photodetection and low‐power synaptic functionalities within a single‐material amorphous Ga2O3 device. This design achieves reversible switching via voltage modulation, supporting high‐contrast imaging and visual memory, and demonstrates a neuromorphic ...
Wanjun Li   +13 more
wiley   +1 more source

Substring Complexity in Sublinear Space

open access: yesCoRR, 2020
Shannon's entropy is a definitive lower bound for statistical compression. Unfortunately, no such clear measure exists for the compressibility of repetitive strings. Thus, ad hoc measures are employed to estimate the repetitiveness of strings, e.g., the size $z$ of the Lempel-Ziv parse or the number $r$ of equal-letter runs of the Burrows-Wheeler ...
Giulia Bernardini 0001   +3 more
openaire   +7 more sources

Home - About - Disclaimer - Privacy