Results 271 to 280 of about 3,977,371 (295)

A FAST ALGORITHM FOR COMPUTING SAMPLE ENTROPY

Advances in Adaptive Data Analysis, 2011
Sample entropy is a widely used tool for quantifying complexity of a biological system. Computing sample entropy directly using its definition requires large computational costs. We propose a fast algorithm based on a k-d tree data structure for computing sample entropy. We prove that the time complexity of the proposed algorithm is [Formula: see text]
Ying Jiang 0002, Dong Mao, Yuesheng Xu
openaire   +2 more sources

Deterministic Sampling Algorithms for Network Design

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

GNNSampler: Bridging the Gap Between Sampling Algorithms of GNN and Hardware

Lecture Notes in Computer Science, 2023
Guangyu Sun, Mingyu Yan, Xiaochun Ye
exaly  

Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs

ACM Transactions on Algorithms, 2023
Marco Bressan
exaly  

Sampling algorithms by regularization and shifting

Signal, Image and Video Processing, 2023
openaire   +1 more source

Sampling-based algorithms for optimal motion planning

International Journal of Robotics Research, 2011
Sertaç Karaman, Emilio Frazzoli
exaly  

Sampling Algorithms

Journal of the American Statistical Association, 2008
openaire   +1 more source

Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))

ACM Transactions on Mathematical Software, 1994
Ronald F Boisvert
exaly  

Stopping Rules for a Class of Sampling-Based Stochastic Programming Algorithms

Operations Research, 1998
David Morton
exaly  

Reliability, sampling, and algorithmic randomness

Proceedings of the symposium on Testing, analysis, and verification, 1991
openaire   +1 more source