Results 231 to 240 of about 1,575,789 (284)
Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints. [PDF]
J Sci ComputBoţ RI, Nguyen DK, Zong C.
europepmc +1 more source
Usage of the adaptive quasi-linear viscoelastic model to predict load-unload, stress-relaxation, and sine load of porcine liver. [PDF]
Sci RepBittner-Frank M +3 more
europepmc +1 more source
A feature selection-based oblique hyperplane for oblique random survival forests. [PDF]
BMC Med Res MethodolSuliman A +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ORSA Journal on Computing, 1994
This paper considers the problem of partitioning the vertices of a weighted complete graph into cliques of unbounded size and number, such that the sum of the edge weights of all cliques is maximized. The problem is known as the clique-partitioning problem and arises as a clustering problem in qualitative data analysis.
Dorndorf, Ulrich, Pesch, Erwin
openaire +1 more source
This paper considers the problem of partitioning the vertices of a weighted complete graph into cliques of unbounded size and number, such that the sum of the edge weights of all cliques is maximized. The problem is known as the clique-partitioning problem and arises as a clustering problem in qualitative data analysis.
Dorndorf, Ulrich, Pesch, Erwin
openaire +1 more source
Journal of the ACM, 1979
We give an algorithm which merges sorted lists represented as balanced binary trees. If the lists have lengths m and n (m $\leq$ n), then the merging procedure runs in O(m log n/m) steps, which is the same order as the lower bound on all comparison-based algorithms for this problem.
Brown, Mark R., Tarjan, Robert E.
openaire +1 more source
We give an algorithm which merges sorted lists represented as balanced binary trees. If the lists have lengths m and n (m $\leq$ n), then the merging procedure runs in O(m log n/m) steps, which is the same order as the lower bound on all comparison-based algorithms for this problem.
Brown, Mark R., Tarjan, Robert E.
openaire +1 more source
Magnetic Resonance Imaging, 1992
Multispectral tissue classification using magnetic resonance T1, T2, and rho images may be useful in diagnosing and locating certain pathology. Techniques for generating the T1 images necessary for this classification scheme often require longer data collection and post processing times than are practical.
J, Gong, J P, Hornak
openaire +2 more sources
Multispectral tissue classification using magnetic resonance T1, T2, and rho images may be useful in diagnosing and locating certain pathology. Techniques for generating the T1 images necessary for this classification scheme often require longer data collection and post processing times than are practical.
J, Gong, J P, Hornak
openaire +2 more sources
Fast Fourier Transform Accelerated Fast Multipole Algorithm
SIAM Journal on Scientific Computing, 1996Summary: This paper describes an \({\mathcal O}(p^2\log_2(p)N)\) implementation of the fast multipole algorithm (FMA) for \(N\)-body simulations. This method of computing the FMA is faster than the original, which is \({\mathcal O}(p^4 N)\), where \(p\) is the number of terms retained in the truncated multipole expansion representation of the potential
Elliott, William D., Board, John A. jun.
openaire +2 more sources
Journal of Algorithms, 1994
The paper presents two new algorithms, the right- and left \(k\)-ary shift algorithms, for the problem of computing the greatest common divisor (GCD) of two given integers. These algorithms are generalizations of the (right-shift) binary and left-shift binary GCD algorithms. For computing the GCD of two \(n\)-bit integers, both algorithms require \(O(n^
openaire +3 more sources
The paper presents two new algorithms, the right- and left \(k\)-ary shift algorithms, for the problem of computing the greatest common divisor (GCD) of two given integers. These algorithms are generalizations of the (right-shift) binary and left-shift binary GCD algorithms. For computing the GCD of two \(n\)-bit integers, both algorithms require \(O(n^
openaire +3 more sources
Engineering Applications of Artificial Intelligence, 2008
The aim of this paper is to design an efficient and fast clonal algorithm for solving various numerical and combinatorial real-world optimization problems effectively and speedily, irrespective of its complexity. The idea is to accurately read the inherent drawbacks of existing immune algorithms (IAs) and propose new techniques to resolve them.
Nitesh Khilwani +3 more
openaire +1 more source
The aim of this paper is to design an efficient and fast clonal algorithm for solving various numerical and combinatorial real-world optimization problems effectively and speedily, irrespective of its complexity. The idea is to accurately read the inherent drawbacks of existing immune algorithms (IAs) and propose new techniques to resolve them.
Nitesh Khilwani +3 more
openaire +1 more source
SPIE Proceedings, 2008
Fourier analysis based focusing of synthetic aperture radar (SAR) data collected during circular flight path is a recent advancement in SAR signal processing. Fast CSAR algorithm uses the Householder transform to obtain a ground plane circular SAR (CSAR) signal phase history from the slant plane CSAR phase history by inverting the linear shift ...
Jehanzeb Burki, Christopher F. Barnes
openaire +1 more source
Fourier analysis based focusing of synthetic aperture radar (SAR) data collected during circular flight path is a recent advancement in SAR signal processing. Fast CSAR algorithm uses the Householder transform to obtain a ground plane circular SAR (CSAR) signal phase history from the slant plane CSAR phase history by inverting the linear shift ...
Jehanzeb Burki, Christopher F. Barnes
openaire +1 more source