Results 271 to 280 of about 8,048,933 (339)
Some of the next articles are maybe not open access.
General Identifiability and Achievability for Causal Representation Learning
International Conference on Artificial Intelligence and Statistics, 2023This paper focuses on causal representation learning (CRL) under a general nonparametric latent causal model and a general transformation model that maps the latent data to the observational data.
Burak Varici +3 more
semanticscholar +1 more source
IEEE Transactions on Aerospace and Electronic Systems, 2022
A framework that could achieve submeter-level unmanned aerial vehicle (UAV) horizontal navigation in multipath-free environments with cellular carrier phase measurements is developed.
Joe J. Khalife, Z. Kassas
semanticscholar +1 more source
A framework that could achieve submeter-level unmanned aerial vehicle (UAV) horizontal navigation in multipath-free environments with cellular carrier phase measurements is developed.
Joe J. Khalife, Z. Kassas
semanticscholar +1 more source
Journal of North African Studies, 2021
This paper surveys and analyses the distance e-learning (DeL, henceforth) experience in Moroccan universities during the Covid-19 quarantine from the perspective of students in order to investigate the reality of things as achievements, failures, and ...
Abdelghanie Ennam
semanticscholar +1 more source
This paper surveys and analyses the distance e-learning (DeL, henceforth) experience in Moroccan universities during the Covid-19 quarantine from the perspective of students in order to investigate the reality of things as achievements, failures, and ...
Abdelghanie Ennam
semanticscholar +1 more source
A Finite Block Length Achievability Bound for Low Probability of Detection Communication [PDF]
International Symposium on Information Theory and its Applications, 2018 Low probability of detection (or covert) communication refers to the scenario where information must be sent reliably to a receiver, but with low probability of detection by an adversary.
Nick Letzepis
exaly +2 more sources
To achieve, or not to achieve complete revascularization
Catheterization and Cardiovascular Interventions, 2016Key Points Prior to minimally invasive valve surgery, a strategy of complete revascularization did not impact overall survival. Angiographically guided revascularization may have resulted in unnecessary procedures. A larger sample size and greater atherosclerotic burden may be needed to observe an impact with complete revascularization.
Jorge A, Belardi, Mariano, Albertal
openaire +2 more sources
Energy Strategy Reviews, 2018
In the last couple of years, Turkey faced serious economic and geopolitical problems. As a result, many from the academia and industry now have suspicions about the viability of Turkey's Vision 2023 electricity targets.
M. Melikoğlu
semanticscholar +1 more source
In the last couple of years, Turkey faced serious economic and geopolitical problems. As a result, many from the academia and industry now have suspicions about the viability of Turkey's Vision 2023 electricity targets.
M. Melikoğlu
semanticscholar +1 more source
On the Achievability of Cramér–Rao Bound in Noisy Compressed Sensing
IEEE Transactions on Signal Processing, 2012 International audienceRecently, it has been proved in Babadi et al. [B. Babadi, N. Kalouptsidis, and V. Tarokh, "Asymptotic achievability of the Cramér-Rao bound for noisy compressive sampling," IEEE Trans. Signal Process., vol. 57, no. 3, pp. 1233-1236,
Massoud Babaie–Zadeh +1 more
exaly +2 more sources
Achievement in Microarchitecture
Communications of the ACM, 2023David Papworth, a 30-year veteran of Intel, on what led to the P6 microprocessor and how that changed the microarchitectural paradigm.
openaire +1 more source
Achievability of Covert Quantum Communication
International Symposium on Information TheoryWe explore covert communication of qubits over an arbitrary quantum channel. Covert communication conceals the transmissions in the channel noise, ensuring that an adversary is unable to detect their presence.
Evan J. D. Anderson +3 more
semanticscholar +1 more source
An Achievability Bound for Type-Based Unsourced Multiple Access
International Symposium on Information TheoryWe derive an achievability bound to quantify the performance of a type-based unsourced multiple access system—an information-theoretic model for grant-free multiple access with correlated messages.
Deekshith Pathayappilly Krishnan +3 more
semanticscholar +1 more source