Results 111 to 120 of about 11,417,388 (340)
Fast algorithms for the characteristics polynomial
Theoretical Computer Science, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
FEBS Open Bio, EarlyView.RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz +6 more
wiley +1 more source
Backward adaptive pixel-based fast predictive motion estimation [PDF]
, 2009 This letter presents a novel backward adaptive pixel-based fast predictive motion estimation (BAPME) scheme for lossless video compression. Unlike the widely used block-matching motion estimation techniques, this method predicts the motion on a pixel-by ...
Canagarajah, CN +2 more
core +1 more source
Fast Feature Ranking Algorithm [PDF]
, 2003 The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simpler and easy to understand. The algorithm has some interesting characteristics: lower computational cost (O(m n log n) m attributes and n examples in the data set) with respect ...
Roberto Ruiz +2 more
openaire +2 more sources
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Fast algorithms for informed independent component/vector extraction
EURASIP Journal on Advances in Signal ProcessingWe propose new and efficient algorithms for semi-blind source extraction derived from the well-known FastICA for independent component analysis (ICA). The algorithms assume independence of the source of interest (SOI) and other signals in the mixture and
Zbyněk Koldovský +4 more
doaj +1 more source
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
High-Performance Passive Macromodeling Algorithms for Parallel Computing Platforms [PDF]
, 2013 This paper presents a comprehensive strategy for fast generation of passive macromodels of linear devices and interconnects on parallel computing hardware.
Gobbato, Luca +4 more
core +1 more source
Framework for Fast Experimental Testing of Autonomous Navigation Algorithms
Applied Sciences, 2019 Research in mobile robotics requires fully operative autonomous systems to test and compare algorithms in real-world conditions. However, the implementation of such systems remains to be a highly time-consuming process.
Miguel Á. Muñoz–Bañón +3 more
doaj +1 more source
RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells
FEBS Open Bio, EarlyView.RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour +2 more
wiley +1 more source