|
|
|
|
|
Chul Yoon and Byung-Min Kim
The purpose of this study was a pilot study to determine the performance level and physiologic responses (heart rate and heart rate recovery (%)) of six different rest interval conditions during the performance of seven sets of a 65% 1RM bench press exer...
ver más
|
|
|
|
|
|
|
|
|
Siriwan Intawichai and Saifon Chaturantabut
An accelerated least-squares approach is introduced in this work by incorporating a greedy point selection method with randomized singular value decomposition (rSVD) to reduce the computational complexity of missing data reconstruction. The rSVD is used ...
ver más
|
|
|
|
|
|
|
|
|
Franz Aurenhammer, Christoph Ladurner and Michael Steinkogler
We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast. Various test data are given, and a clustering method for speeding up the construction is prop...
ver más
|
|
|
|
|
|
|
|
|
Max Bannach and Sebastian Berndt
Research on the similarity of a graph to being a tree?called the treewidth of the graph?has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It is based o...
ver más
|
|
|
|
|
|
|
|
|
Santiago Tapia-Fernández, Daniel García-García and Pablo García-Hernandez
Most computer programs or applications need fast data structures. The performance of a data structure is necessarily influenced by the complexity of its common operations; thus, any data-structure that exhibits a theoretical complexity of amortized const...
ver más
|
|
|
|