Search Results - "Divide and conquer algorithms"

A PARTIALLY LINEAR FRAMEWORK FOR MASSIVE HETEROGENEOUS DATA by Zhao, Tianqi, Cheng, Guang, Liu, Han

“…We consider a partially linear framework for modelling massive heterogeneous data. The major goal is to extract common features across all sub-populations…”
Get more information

Systems of implications obtained using the Carve decomposition of a formal context by López-Rodríguez, Domingo, Ojeda-Hernández, Manuel, Pattison, Tim

“…The Carve algorithm uses a divide-and-conquer strategy to compute the concept lattice of a formal context. The decomposition phase of the Carve algorithm…”
Get full text

Fast associated classical orthogonal polynomial transforms by Klippenstein, Brock, Slevinsky, Richard Mikaël

“…We discuss a fast approximate solution to the associated classical–classical orthogonal polynomial connection problem. We first show that associated classical…”
Get full text

A multi-stage intelligent approach based on an ensemble of two-way interaction model for forecasting the global horizontal radiation of India by Jiang, He, Dong, Yao, Xiao, Ling

“…•Ensemble learning system is proposed to forecast the global solar radiation.•LASSO is utilized as feature selection method for subset model.•GSO is used to…”
Get full text

Accurate computation of moist available potential energy with the Munkres algorithm by Stansifer, Eric M., O'Gorman, Paul A., Holt, Jareth I.

“…The moist available potential energy (MAPE) of a domain of air is defined as the maximum amount of kinetic energy that can be released through reversible…”
Get full text

Uniform inference in linear error-in-variables models: Divide-and-conquer by Boot, Tom, Juodis, Artūras

“…It is customary to estimate error-in-variables models using higher-order moments of observables. This moments-based estimator is consistent only when the…”
Get full text

CAESAR: a new conformer generation algorithm based on recursive buildup and local rotational symmetry consideration by Li, Jiabo, Ehlers, Tedman, Sutter, Jon, Varma-O'brien, Shikha, Kirchmair, Johannes

“…A highly efficient conformer search algorithm based on a divide-and-conquer and recursive conformer build-up approach is presented in this paper. This approach…”
Get more information

A unified approach to the Galois closure problem by Huang, Hau-Wen, Li, Wen-Ching Winnie

“…In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases…”
Get full text

A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem by Akhmedov, Murodzhon, Kwee, Ivo, Montemanni, Roberto

“…The Prize-collecting Steiner Tree Problem (PCSTP) is a well-known problem in graph theory and combinatorial optimization. It has been successfully applied to…”
Get full text

Scalable and noise tolerant web knowledge extraction for search task simplification by He, Jun, Gu, Yingqin, Liu, Hongyan, Yan, Jun, Chen, Hong

“…The simplification of key tasks of search engine users by directly returning structured knowledge according to their query intents has attracted much attention…”
Get full text

Proving Divide and Conquer Complexities in Isabelle/HOL by Eberl, Manuel

“…The Akra–Bazzi method (Akra and Bazzi in Comput Optim Appl 10(2):195–210,  1998 . doi: 10.1023/A:1018373005182 ), a generalisation of the well-known Master…”
Get full text

Bit-Width Optimization by Divide-and-Conquer for Fixed-Point Digital Signal Processing Systems by Chung, Jaeyong, Kim, Lok-Won

“…This paper presents a novel approach to fractional bit-width optimization of fixed-point designs. We first propose a divide-and-conquer algorithm that can…”
Get full text

The Transit Route Arc-Node Service Maximization problem by Curtin, Kevin M., Biba, Steve

“…This article presents a new method for determining optimal transit routes. The Transit Route Arc-Node Service Maximization model is a mathematical model that…”
Get full text

Lower bounds for the ITC-2007 curriculum-based course timetabling problem by Hao, Jin-Kao, Benlic, Una

“…This paper describes an approach for generating lower bounds for the curriculum-based course timetabling problem, which was presented at the International…”
Get full text

Lethal Mutagenesis of Bacteria by Bull, James J, Wilke, Claus O

“…Lethal mutagenesis, the killing of a microbial pathogen with a chemical mutagen, is a potential broad-spectrum antiviral treatment. It operates by raising the…”
Get full text

A divide and conquer algorithm for exploiting policy function monotonicity by Gordon, Grey, Qiu, Shi

“…A divide and conquer algorithm for exploiting policy function monotonicity is proposed and analyzed. To solve a discrete problem with n states and n choices,…”
Get full text

A uniform random test data generator for path testing by Gotlieb, Arnaud, Petit, Matthieu

“…Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a…”
Get full text

New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces by Romaguera, S., Tirado, P., Valero, O.

“…Schellekens [The Smyth completion: A common foundation for denotational semantics and complexity analysis, Electron. Notes Theor. Comput. Sci. 1 (1995), pp…”
Get full text

A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem by Alam, Muhammad Rashed, Rahman, M. Sohel

“…In this paper, we present a divide and conquer approach to solve the problem of computing a longest increasing subsequence. Our approach runs in O(nlogn) time…”
Get full text

DCMB that combines divide-and-conquer and mixed-basis set methods for accurate geometry optimizations, total energies, and vibrational frequencies of large molecules by Wu, Anan, Xu, Xin

“…We present a method, named DCMB, for the calculations of large molecules. It is a combination of a parallel divide‐and‐conquer (DC) method and a mixed‐basis…”
Get full text