Results 71 to 80 of about 192,292 (306)
New Non-Uniform Lower Bounds for Uniform Classes.
, 2016 We strengthen the nondeterministic hierarchy theorem for non-deterministic polynomial time to show that the lower bound holds against sub-linear advice. More formally, we show that for any constants d and d' such that 1 <= d < d', and for any time-constructible bound t=o(n^d), there is a language in NTIME(n^d) which is not in NTIME(t)/n^{1/d ...
Lance Fortnow, Rahul Santhanam
openaire +3 more sources
A uniform relative Dobrowolski's lower bound over abelian extensions.
, 2010 International audienceLet L/K be an abelian extension of number fields. We prove an uniform lower bound for the height in L^∗ outside roots of unity. This lower bound depends only on the degree [L : K]
Zannier, Umberto +2 more
core +1 more source
Bias-Variance Tradeoffs Analysis Using Uniform CR Bound For a SPECT System [PDF]
, 1993 The authors quantify fundamental bias-variance tradeoffs for the image reconstruction problem in radio-pharmaceutical tomography using Cramer-Rao (CR) bound analysis. The image reconstruction problem is very often biased and the classical or the unbiased
Hero,Alfred O. +3 more
core +1 more source
FEBS Open Bio, EarlyView.Enzymes of the 2‐hydroxyacyl‐CoA lyase group catalyze the condensation of formyl‐CoA with aldehydes or ketones. Thus, by structural adaptation of active sites, practically any pharmaceutically and industrially important 2‐hydroxyacid could be biotechnologically synthesized. Combining crystal structure analysis, active site mutations and kinetic assays,
Michael Zahn +4 more
wiley +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
An Algorithmic Approach to Uniform Lower Bounds.
Electron. Colloquium Comput. Complex., 2023 We propose a new family of circuit-based sampling tasks, such that non-trivial algorithmic solutions to certain tasks from this family imply frontier uniform lower bounds such as "NP is not in uniform ACC⁰" and "NP does not have uniform polynomial-size depth-two threshold circuits".
openaire +4 more sources
Uniform Convergence Bounds for Codec Selection
CoRR, 2018 We frame the problem of selecting an optimal audio encoding scheme as a supervised learning task. Through uniform convergence theory, we guarantee approximately optimal codec selection while controlling for selection bias. We present rigorous statistical guarantees for the codec selection problem that hold for arbitrary distributions over audio ...
Clayton Sanford +2 more
openaire +2 more sources
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
(Quasi)‐uniformities on the set of bounded maps [PDF]
International Journal of Mathematics and Mathematical Sciences, 1993 From real analysis it is known that if a sequence {fn, n ∈ ℕ} of real‐valued functions defined and bounded on X ⊂ ℝ converges uniformly to f, then f is also bounded and the sequence {fn, n ∈ ℕ}. In the present paper we generalize results as the above using (quasi)‐uniform structures.
openaire +3 more sources