Results 291 to 300 of about 11,417,388 (340)
Some of the next articles are maybe not open access.
Caffe: Convolutional Architecture for Fast Feature Embedding
ACM Multimedia, 2014Caffe provides multimedia scientists and practitioners with a clean and modifiable framework for state-of-the-art deep learning algorithms and a collection of reference models.
Yangqing Jia +7 more
semanticscholar +1 more source
Computing in Science & Engineering, 2000
Accurate computation of the mutual interactions of N particles through electrostatic or gravitational forces has impeded progress in many areas of simulation science. The fast multipole algorithm (FMA) provides an efficient scheme for reducing computational complexity.
John Board, Klaus Schulten
openaire +2 more sources
Accurate computation of the mutual interactions of N particles through electrostatic or gravitational forces has impeded progress in many areas of simulation science. The fast multipole algorithm (FMA) provides an efficient scheme for reducing computational complexity.
John Board, Klaus Schulten
openaire +2 more sources
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
A fast algorithm for or-and-or synthesis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2003Design methods for OR-AND-OR three-level networks are useful for exploiting the flexibility of logic blocks in many complex programmable logic devices. This paper presents T RIMIN, a fast heuristic algorithm for designing OR-AND-OR networks from sum-of-products expressions.
Debatosh Debnath, Zvonko G. Vranesic
openaire +1 more source
An Algorithm of Fast Interpolation
2009 WRI World Congress on Computer Science and Information Engineering, 2009There are many approaches to realize interpolation. Padding zeros in the high frequency band of a real sequence results in interpolation in time domain. For the discrete frequency spectrum with high frequency band being zeros, this paper proposes a fast implementation method of inverse fast Fourier transform to reduce the computational cost.
Yechao Bai, Xinggan Zhang
openaire +1 more source
2010 International Conference on Computational Intelligence and Security, 2010
The HITON_PC algorithm which is a state-of-the-art local causal discovery algorithm can deal with a dataset with a very small sample-to-variable ratio efficiently. But it cannot perform inefficiently on a dataset with a very large sample. To address this problem, a fast HITON_PC algorithm is presented which uses a new yet simple search strategy from ...
openaire +2 more sources
The HITON_PC algorithm which is a state-of-the-art local causal discovery algorithm can deal with a dataset with a very small sample-to-variable ratio efficiently. But it cannot perform inefficiently on a dataset with a very large sample. To address this problem, a fast HITON_PC algorithm is presented which uses a new yet simple search strategy from ...
openaire +2 more sources
13th Annual Symposium on Switching and Automata Theory (swat 1972), 1972
In this paper we consider polynomial-time algorithms for bin packing and their applications. The previously studied FIRST FIT and BEST FIT algorithms are shown to be special cases of a more generalized class of algorithms which all have similar worst case behavior.
openaire +1 more source
In this paper we consider polynomial-time algorithms for bin packing and their applications. The previously studied FIRST FIT and BEST FIT algorithms are shown to be special cases of a more generalized class of algorithms which all have similar worst case behavior.
openaire +1 more source
Fast Algorithms for Approximating Distances
Algorithmica, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergei Bespamyatnikh, Michael Segal 0001
openaire +1 more source
International Journal of Pattern Recognition and Artificial Intelligence, 2002
A fast support vector machine (SVM) training algorithm is proposed under SVM's decomposition framework by effectively integrating kernel caching, digest and shrinking policies and stopping conditions. Kernel caching plays a key role in reducing the number of kernel evaluations by maximal reusage of cached kernel elements.
Jian-xiong Dong +2 more
openaire +3 more sources
A fast support vector machine (SVM) training algorithm is proposed under SVM's decomposition framework by effectively integrating kernel caching, digest and shrinking policies and stopping conditions. Kernel caching plays a key role in reducing the number of kernel evaluations by maximal reusage of cached kernel elements.
Jian-xiong Dong +2 more
openaire +3 more sources
Replacing the Irreplaceable: Fast Algorithms for Team Member Recommendation
The Web Conference, 2014In this paper, we study the problem of TEAM MEMBER REPLACEMENT -- given a team of people embedded in a social network working on the same task, find a good candidate to best replace a team member who becomes unavailable to perform the task for certain ...
Liangyue Li +5 more
semanticscholar +1 more source