Results 171 to 180 of about 366 (206)
Some of the next articles are maybe not open access.
Divide-and-conquer strategies for large-scale simulations in R
2017 IEEE International Conference on Big Data (Big Data), 2017As the volume of data and technical complexity of large-scale analysis increases, many domain experts desire a computational powerful but still familiar analysis interface to fully participate in the analysis workflow by just focusing on individual datasets, leaving the large-scale computation to the system.
Hui Zhang 0006 +2 more
openaire +1 more source
Novel multiscale models in a multicontinuum approach to divide and conquer strategies
Computational and Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raúl A. Feijóo +3 more
openaire +4 more sources
Divide and Conquer Strategies for Protein Structure Prediction
2010In this chapter we discuss some approaches to the problem of protein structure prediction by addressing ”simpler” sub-problems. The rationale behind this approach is to develop methods that can predict some interesting structural characteristics of the proteins that can be useful per se and, at the same time, can be of some help for the solution of the
DI LENA, PIETRO +4 more
openaire +2 more sources
Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion, 2020
The multi-cloud composite applications deployment problem (MCADP) aims to select proper cloud resources from multiple cloud providers at different locations to deploy applications with shared constituent services in order to optimize performance and cost.
Tao Shi, Hui Ma 0001, Gang Chen 0002
openaire +1 more source
The multi-cloud composite applications deployment problem (MCADP) aims to select proper cloud resources from multiple cloud providers at different locations to deploy applications with shared constituent services in order to optimize performance and cost.
Tao Shi, Hui Ma 0001, Gang Chen 0002
openaire +1 more source
Divide and conquer strategies for parallel TSP heuristics
Computers & Operations Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2006
AbstractThere are two obvious kinds of manoeuvres for rejecting the existence of full-fledged non-sentential speech acts, thereby avoiding the implications canvassed briefly in Chapter 1. The first is to deny that there are full-fledged speech acts performed at all.
openaire +1 more source
AbstractThere are two obvious kinds of manoeuvres for rejecting the existence of full-fledged non-sentential speech acts, thereby avoiding the implications canvassed briefly in Chapter 1. The first is to deny that there are full-fledged speech acts performed at all.
openaire +1 more source
The divide and conquer strategies for deep phosphoproteomics analysis
TrAC Trends in Analytical Chemistry, 2018Abstract With the advance of mass spectrometry based proteomics techniques, thousands of phosphorylation sites can be identified from a single cell line or a single tissue sample by large scale global analysis. However, such large scale analysis is time consuming.
Mingming Dong +4 more
openaire +1 more source
Divide and conquer strategy for spectral clustering
Proceedings of the 10th World Congress on Intelligent Control and Automation, 2012The spectral clustering algorithm's space complexity is O(n2), while time complexity is O(n3). When dealing with large amounts of data, the memory will overflow and run-time is too long. For the general problem of spectral clustering, if the clustering data of sub-problem between the original problem has the same probability distribution, it can be ...
exaly +2 more sources
High Utility Itemsets Mining Based on Divide-and-Conquer Strategy
Wireless Personal Communications, 2020High utility itemsets mining has become a hot research topic in association rules mining. But many algorithms directly mine datasets, and there is a problem on dense datasets, that is, too many itemsets stored in each transaction. In the process of mining association rules, it takes a lot of storage space and affects the running efficiency of the ...
Jiyong Liao, Sheng Wu, Ailian Liu
openaire +1 more source
Divide-and-Conquer Strategies for Estimating Multiple Transparent Motions
2007Transparent motions are additive or multiplicative superpositions of moving patterns and occur due to reflections, semi-transparencies, and partial occlusions. The estimation of transparent motions remained a challenging nonlinear problem. We here first linearize the problem in a way which makes it accessible to the known methods used for the ...
Cicero Mota +3 more
openaire +1 more source