Results 31 to 40 of about 11,417,388 (340)
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable [PDF]
There has been significant recent interest in parallel graph processing due to the need to quickly analyze the large graphs available today. Many graph codes have been designed for distributed memory or external memory.
Laxman Dhulipala +2 more
semanticscholar +1 more source
A Fast Algorithm for Backbones [PDF]
A matching algorithm for the identification of backbones in percolation problems is introduced. Using this procedure, percolation backbones are studied in two- to five-dimensional systems containing 1.7×107 sites, two orders of magnitude larger than was previously possible using burning algorithms.
openaire +2 more sources
Fast algorithm for Morphological Filters [PDF]
In surface metrology, M-system (Mean-line filtering system) and E-system (Envelope filtering system) are two filtering approaches. Although M-system has been the dominant choice and played an important role in manufacturing control, Morphological filters, that evolved from the E-system, are believed to give better results in function prediction of ...
S. Lou, X. Jiang, P.J. Scott
openaire +2 more sources
Fast and robust three-dimensional best path phase unwrapping algorithm [PDF]
What we believe to be a novel three-dimensional (3D) phase unwrapping algorithm is proposed to unwrap 3D wrapped-phase volumes. It depends on a quality map to unwrap the most reliable voxels first and the least reliable voxels last.
Moore, Christopher J. +5 more
core +1 more source
A toolset for the analysis and optimization of motion estimation algorithms and processors [PDF]
This paper presents a reconfigurable processor designed to execute user-defined block-matching motion estimation algorithms, and a toolset for the design of such algorithms and for the configuration of the processor.
Spiteri, T +5 more
core +1 more source
Comparison of fast regression algorithms in large datasets
The aim is to compare the performances of fast regression methods, namely dimensional reduction of correlation matrix (DRCM), nonparametric dimensional reduction of correlation matrix (N-DRCM), variance inflation factor (VIF) regression, and robust VIF (
Sengul Cangur, Handan Ankarali
doaj +1 more source
A fast algorithm for matrix balancing [PDF]
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the matrix can be balanced, that is we can find a diagonal scaling of A that is doubly stochastic. A number of algorithms have been proposed to achieve the balancing, the most well known of these being the Sinkhorn-Knopp algorithm. In this paper we derive new algorithms
Knight, Philip, Ruiz, Daniel
openaire +7 more sources
Fast implementations of block motion estimation algorithms in video encoders [PDF]
This research is aimed at designing and implementing novel fast algorithms for speeding up the encoding process. The objective of this study was to come up with algorithms which can estimate the data significantly faster than the existing algorithms ...
Koduri, Naga Rohini
core +1 more source
Maximally fast coarsening algorithms [PDF]
We present maximally-fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time-step $Δt=A t_s^{2/3}$. For non-conserved systems, only effectively finite timesteps are accessible for similar unconditionally stable algorithms.
Cheng, Mowei, Rutenberg, Andrew
openaire +3 more sources
On the use of biased-randomized algorithms for solving non-smooth optimization problems
Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Juan A.A. +4 more
core +1 more source

