Results 201 to 210 of about 7,976,671 (238)
ADAPT: An Autonomous Forklift for Construction Site Operation
ABSTRACT Efficient material logistics are critical in controlling costs and schedules in the construction industry. However, manual material handling remains prone to inefficiencies, delays, and safety risks. Autonomous forklifts offer a solution to streamline on‐site logistics, reducing reliance on human operators and mitigating labor shortages.
Johannes Huemer +12 more
wiley +1 more source
Machine learning provides a unifying framework to connect structure, fluorescence properties, and applications of carbon‐based quantum dots. This review highlights how data‐driven strategies enable fluorescence regulation, reveal underlying mechanisms, and accelerate the rational design of functional carbon dots.
Liangfeng Chen +8 more
wiley +1 more source
Uncertainty Characterization Framework for Machine Learning Based ACM in Q‐Band Satellite Links
ABSTRACT Adaptive coding and modulation (ACM) is a widely utilized technique in satellite communication networks to mitigate the adverse effects of rain fades, particularly in extremely high frequency (EHF) bands. As a core component of fade mitigation techniques (FMTs), ACM improves signal resilience.
Kamolideen Abolarinwa +3 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Scalable Mean-Field Sparse Bayesian Learning
IEEE Transactions on Signal Processing, 2019Sparse Bayesian learning is a powerful framework for expressing compressed sensing problems in the language of Bayesian inference, but its principal algorithm—the variational relevance vector machine—is matrix-bound and scales poorly to larger problem sizes.
Bradley Worley
exaly +3 more sources
Sparse Bayesian learning for ranking
2009 IEEE International Conference on Granular Computing, 2009In this paper, we propose a sparse Bayesian kernel approach to learn ranking function. In sparse Bayesian framework, a relevance determination prior over weights is used to automatic relevance determination. The inference techniques based on Laplace approximation is derived for model selection. By this approach accurate prediction models can be derived,
Xiao Chang, Qinghua Zheng
openaire +2 more sources
Sparse Bayesian learning for efficient visual tracking
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005This paper extends the use of statistical learning algorithms for object localization. It has been shown that object recognizers using kernel-SVMs can be elegantly adapted to localization by means of spatial perturbation of the SVM. While this SVM applies to each frame of a video independently of other frames, the benefits of temporal fusion of data ...
Oliver Williams +2 more
openaire +3 more sources
Sparse Bayesian learning for beamforming using sparse linear arrays
The Journal of the Acoustical Society of America, 2018Sparse linear arrays such as co-prime and nested arrays can resolve more sources than the number of sensors. In contrast, uniform linear arrays (ULA) cannot resolve more sources than the number of sensors. This paper demonstrates this using Sparse Bayesian learning (SBL) and co-array MUSIC for single frequency beamforming.
Santosh, Nannuru +4 more
openaire +2 more sources
Sparse Bayesian learning with uncertain sensing matrix
2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2017Sparse Bayesian learning is a sparse processing method used for solving high-dimensional, underdetermined linear equations. Often the sensing matrix in the system of equations is assumed known and in presence of perturbations in this matrix performance of sparse processing degrades.
Santosh Nannuru +2 more
openaire +2 more sources
Dynamical System Implementations of Sparse Bayesian Learning
2019 IEEE 8th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2019Despite its state of the art performance in many applications, the sparse Bayesian learning (SBL) procedure can be expensive to implement, limiting its use in practice. In this paper, we use the locally competitive algorithm (LCA) framework to develop two continuous time dynamical systems whose trajectories converge to a minimum of the SBL objective ...
Matthew R. O'Shaughnessy +2 more
openaire +2 more sources
Active learning for sparse bayesian multilabel classification
Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, 2014We study the problem of active learning for multilabel classification. We focus on the real-world scenario where the average number of positive (relevant) labels per data point is small leading to positive label sparsity. Carrying out mutual information based near-optimal active learning in this setting is a challenging task since the computational ...
Deepak Vasisht +3 more
openaire +1 more source

