Results 51 to 60 of about 4,491,165 (327)
Oracle inequalities for weighted group lasso in high-dimensional misspecified Cox models
We study the nonasymptotic properties of a general norm penalized estimator, which include Lasso, weighted Lasso, and group Lasso as special cases, for sparse high-dimensional misspecified Cox models with time-dependent covariates.
Yijun Xiao +3 more
doaj +1 more source
Effects of Noisy Oracle on Search Algorithm Complexity
Grover's algorithm provides a quadratic speed-up over classical algorithms for unstructured database or library searches. This paper examines the robustness of Grover's search algorithm to a random phase error in the oracle and analyzes the complexity of
B. Pablo-Norman +13 more
core +1 more source
Oblivious Transfer Based on NTRUEncrypt
Oblivious transfer (OT) is the most fundamental process in cryptosystems and serves as the basic building block for implementing protocols, such as the secure multi-party computation and the fair electronic contract.
Bo Mi +4 more
doaj +1 more source
Customizing Tactile Sensors via Machine Learning‐Driven Inverse Design
ABSTRACT Replicating the sophisticated sense of touch in artificial systems requires tactile sensors with precisely tailored properties. However, manually navigating the complex microstructure‐property relationship results in inefficient and suboptimal designs.
Baocheng Wang +15 more
wiley +1 more source
Certificateless signature scheme without random oracles
The security of certificateless signature schemes can be proved under the random oracle model.However,any implementation of the random oracle may result in insecure schemes.Some certificateless signature schemes without random oracles are not secure ...
Yan-qiong LI, Ji-guo LI, Yi-chen ZHANG
doaj +2 more sources
Strengths and Weaknesses of Quantum Computing
Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of
Charles H. Bennett +4 more
core +4 more sources
Las Vegas Computability and Algorithmic Randomness [PDF]
In this article we try to formalize the question “What can be computed with access to randomness?” We propose the very fine-grained Weihrauch lattice as an approach to differentiate between different types of computation with access to randomness.
GHERARDI, GUIDO +2 more
core +2 more sources
Tighter proofs of CCA security in the quantum random oracle model
We revisit the construction of IND-CCA secure key encapsulation mechanisms (KEM) from public-key encryption schemes (PKE). We give new, tighter security reductions for several constructions.
Nina Bindel +3 more
semanticscholar +1 more source
Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley +1 more source
Flexible Memory: Progress, Challenges, and Opportunities
Flexible memory technology is crucial for flexible electronics integration. This review covers its historical evolution, evaluates rigid systems, proposes a flexible memory framework based on multiple mechanisms, stresses material design's role, presents a coupling model for performance optimization, and points out future directions.
Ruizhi Yuan +5 more
wiley +1 more source

