ARTÍCULO
TITULO

Tracking: How Hard Can It Be?

Julier    
S. Bishop    
G.    

Resumen

No disponible

 Artículos similares

       
 
Gregory Provan    
Autoencoders have been used widely for diagnosing devices, for example, faults in rotating machinery. However, autoencoder-based approaches lack explainability for their results and can be hard to tune. In this article, we propose an explainable method f... ver más
Revista: Algorithms

 
Jie Wang, Hai Lin, Huaihai Guo, Qi Zhang and Junxiang Ge    
The characterization of targets by electromagnetic (EM) scattering and underwater acoustic scattering is an important object of research in these two related fields. However, there are some difficulties in the simulation and measurement of the scattering... ver más

 
Haoyu Chen, Stacy Lindshield, Papa Ibnou Ndiaye, Yaya Hamady Ndiaye, Jill D. Pruetz and Amy R. Reibman    
Few-shot learning (FSL) describes the challenge of learning a new task using a minimum amount of labeled data, and we have observed significant progress made in this area. In this paper, we explore the effectiveness of the FSL theory by considering a rea... ver más
Revista: AI

 
Franz Georg Fuchs, Kjetil Olsen Lye, Halvor Møll Nilsen, Alexander Johannes Stasik and Giorgio Sartor    
The quantum approximate optimization algorithm/quantum alternating operator ansatz (QAOA) is a heuristic to find approximate solutions of combinatorial optimization problems. Most of the literature is limited to quadratic problems without constraints. Ho... ver más
Revista: Algorithms

 
Massimiliano Cutugno, Annarita Giani, Paul M. Alsing, Laura Wessing and Austar Schnore    
Quantum computing has the potential to revolutionize the way hard computational problems are solved in terms of speed and accuracy. Quantum hardware is an active area of research and different hardware platforms are being developed. Quantum algorithms ta... ver más
Revista: Algorithms