Log in

Relevant bibliographies by topics / Measure-and-conquer

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Measure-and-conquer'

Author: Grafiati

Published: 4 June 2021

Last updated: 8 June 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Measure-and-conquer.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Measure-and-conquer"

1

Gaspers, Serge, and Gregory B. Sorkin. "Separate, Measure and Conquer." ACM Transactions on Algorithms 13, no. 4 (2017): 1–36. http://dx.doi.org/10.1145/3111499.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Fomin, Fedor V., Fabrizio Grandoni, Artem V. Pyatkin, and Alexey A. Stepanov. "Combinatorial bounds via measure and conquer." ACM Transactions on Algorithms 5, no. 1 (2008): 1–17. http://dx.doi.org/10.1145/1435375.1435384.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Aqel, F., K. Alaa, N. E. Alaa, and M. Atounti. "Hybridization of Divide-and-Conquer technique and Neural Network algorithm for better contrast enhancement in medical images." Mathematical Modeling and Computing 9, no. 4 (2022): 921–35. http://dx.doi.org/10.23939/mmc2022.04.921.

Full text

Abstract:

The aim of this work is to propose a new method for optimal contrast enhancement of a medical image. The main idea is to improve the Divide-and-Conquer method to enhance the contrast, and highlight the information and details of the image, based on a new conception of the Neural Network algorithm. The Divide-and-Conquer technique is a suitable method for contrast enhancement with an efficiency that directly depends on the choice of weights in the decomposition subspaces. A new hybrid algorithm was used for the optimal selection of weights, considering the optimization of the enhancement measur

APA, Harvard, Vancouver, ISO, and other styles

4

Alaa, N. E., K. Alaa, M. Atounti, and F. Aqel. "A new mathematical model for contrast enhancement in digital images." Mathematical Modeling and Computing 9, no. 2 (2022): 342–50. http://dx.doi.org/10.23939/mmc2022.02.342.

Full text

Abstract:

The aim of this work is to propose a new mathematical model for optimal contrast enhancement of a digital image. The main idea is to combine the Divide-and-Conquer strategy, and a reaction diffusion mathematical model to enhance the contrast, and highlight the information and details of the image, based on a new conception of the Sine-Cosine optimization algorithm. The Divide-and-Conquer technique is a suitable method for contrast enhancement with an efficiency that directly depends on the choice of weights in the decomposition subspaces. Methods: in this paper, a new algorithm has been used f

APA, Harvard, Vancouver, ISO, and other styles

5

Dube, Simant. "Using fractal geometry for solving divide-and-conquer recurrences." Journal of the Australian Mathematical Society. Series B. Applied Mathematics 37, no. 2 (1995): 145–71. http://dx.doi.org/10.1017/s0334270000007633.

Full text

Abstract:

AbstractA relationship between the fractal geometry and the analysis of recursive (divide-and-conquer) algorithms is investigated. It is shown that the dynamic structure of a recursive algorithm which might call other algorithms in a mutually recursive fashion can be geometrically captured as a fractal (self-similar) image. This fractal image is defined as the attractor of a mutually recursive function system. It then turns out that the Hausdorff-Besicovich dimension D of such an image is precisely the exponent in the time complexity of the algorithm being modelled. That is, if the Hausdorff D

APA, Harvard, Vancouver, ISO, and other styles

6

Yang, Jiaqi, Shiqi Chen, Qi Li, Tingting Jiang, Yueting Chen, and Jing Wang. "Epistemic-Uncertainty-Based Divide-and-Conquer Network for Single-Image Super-Resolution." Electronics 11, no. 22 (2022): 3809. http://dx.doi.org/10.3390/electronics11223809.

Full text

Abstract:

The introduction of convolutional neural networks (CNNs) into single-image super-resolution (SISR) has resulted in remarkable performance in the last decade. There is a contradiction in SISR between indiscriminate processing and the different processing difficulties in different regions, leading to the need for locally differentiated processing of SR networks. In this paper, we propose an epistemic-uncertainty-based divide-and-conquer network (EU-DC) in order to address this problem. Firstly, we build an image-gradient-based divide-and-conquer network (IG-DC) that utilizes gradient-based divis

APA, Harvard, Vancouver, ISO, and other styles

7

Yao, Can Zhong, Bo Yi Sun, and Ji Nan Lin. "A study of correlation between investor sentiment and stock market based on Copula model." Kybernetes 46, no. 3 (2017): 550–71. http://dx.doi.org/10.1108/k-10-2016-0297.

Full text

Abstract:

Purpose This paper aims to capture tail dependence between sentiment index and Shanghai composite index (SCI) by proposing a sentiment index based on text mining. Design/methodology/approach Online text mining and the Copula model were used in this study. Findings First, the paper finds herding effect in the expression of investors’ sentiment from online text data, and the usage occurrence frequency of most vocabulary is less correlative with SCI. Second, given these two features, the paper uses weighted divide-and-conquer algorithm to construct a sentiment index. Finally, because of multivari

APA, Harvard, Vancouver, ISO, and other styles

8

PAPADOPOULOU, EVANTHIA, and D. T. LEE. "THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH." International Journal of Computational Geometry & Applications 14, no. 06 (2004): 421–52. http://dx.doi.org/10.1142/s0218195904001536.

Full text

Abstract:

We study the Hausdorff Voronoi diagram of a set S of polygonal objects in the plane, a generalization of Voronoi diagrams based on the maximum distance of a point from a polygon, and show that it is equivalent to the Voronoi diagram of S under the Hausdorff distance function. We investigate the structural and combinatorial properties of the Hausdorff Voronoi diagram and give a divide and conquer algorithm for the construction of this diagram that improves upon previous results. As a byproduct we introduce the Hausdorff hull, a structure that relates to the Hausdorff Voronoi diagram in the same

APA, Harvard, Vancouver, ISO, and other styles

9

Zhao, Daliang, and Juan Mao. "New Controllability Results of Fractional Nonlocal Semilinear Evolution Systems with Finite Delay." Complexity 2020 (July 13, 2020): 1–13. http://dx.doi.org/10.1155/2020/7652648.

Full text

Abstract:

In the present paper, sufficient conditions ensuring the complete controllability for a class of semilinear fractional nonlocal evolution systems with finite delay in Banach spaces are derived. The new results are obtained under a weaker definition of complete controllability we introduced, and then the Lipschitz continuity and other growth conditions for the nonlinearity and nonlocal item are not required in comparison with the existing literatures. In addition, an appropriate complete space and a corresponding time delay item are introduced to conquer the difficulties caused by time delay. O

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Lu. "The enlightenment of western university construction to college education construction in China." Journal of Education, Humanities and Social Sciences 19 (August 17, 2023): 6–14. http://dx.doi.org/10.54097/ehss.v19i.10938.

Full text

Abstract:

There are many factors involved in improving the quality of university education.The most important factor restricting. the quality of university education is specialty construction.The university's specialty is the part that is most closely related to the labor market.Strengthening specialty construction,especially the construction of characteristic specialties is undoubtedly an important measure. A stone from another mountain can conquer a jade.The history and present situation of characteristic subject development and specialty construction in western universities enlighten us a lot.Under t

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Measure-and-conquer"

1

Binkele-Raible, Daniel [Verfasser], and Henning [Akademischer Betreuer] Fernau. "Amortized Analysis of Exponential Time- and Parameterized Algorithms: Measure & Conquer and Reference Search Trees / Daniel Binkele-Raible ; Betreuer: Henning Fernau." Trier : Universität Trier, 2010. http://d-nb.info/119769658X/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Norhazwani, Md Yunos. "Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs." 京都大学 (Kyoto University), 2017. http://hdl.handle.net/2433/225741.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Cochefert, Manfred. "Algorithmes exacts et exponentiels pour les problèmes NP-difficiles sur les graphes et hypergraphes." Thesis, Université de Lorraine, 2014. http://www.theses.fr/2014LORR0336/document.

Full text

Abstract:

Dans cette thèse, nous nous intéressons à la résolution exacte de problèmes NP-difficiles sur les graphes et les hypergraphes. Les problèmes que nous étudions regroupent dans un premier temps des variantes du problème classique du nombre chromatique. Les variantes de ce problème se distinguent par la difficulté introduite par les relations entre les classes de couleurs, ou la difficulté de reconnaissance des classes de couleurs elles-mêmes. Puis nous ferons le lien avec les problèmes de transversaux sur les hypergraphes. Plus particulièrement, il s’agira de s’intéresser à l’énumération de tran

APA, Harvard, Vancouver, ISO, and other styles

4

Cochefert, Manfred. "Algorithmes exacts et exponentiels pour les problèmes NP-difficiles sur les graphes et hypergraphes." Electronic Thesis or Diss., Université de Lorraine, 2014. http://www.theses.fr/2014LORR0336.

Full text

Abstract:

Dans cette thèse, nous nous intéressons à la résolution exacte de problèmes NP-difficiles sur les graphes et les hypergraphes. Les problèmes que nous étudions regroupent dans un premier temps des variantes du problème classique du nombre chromatique. Les variantes de ce problème se distinguent par la difficulté introduite par les relations entre les classes de couleurs, ou la difficulté de reconnaissance des classes de couleurs elles-mêmes. Puis nous ferons le lien avec les problèmes de transversaux sur les hypergraphes. Plus particulièrement, il s’agira de s’intéresser à l’énumération de tran

APA, Harvard, Vancouver, ISO, and other styles

5

Su, Ping-Chen, and 蘇柄臣. "Time Complexity Analysis of a Branch-and-Reduce Algorithm: Using Measure and Conquer Technique." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/02280138951901124232.

Full text

Abstract:

碩士<br>國立中正大學<br>資訊工程研究所<br>100<br>Algorithms designed for solving NP-hard or NP-complete problems exactly are called exact algorithms. In past decades, many problems were proved to be NP-hard or NP-complete. More and more researchers are interested in developing efficient exact algorithms to solve these problems. Time complexity analysis of exact algorithms becomes a remarkable issue on developing exact algorithms. One of the major techniques of designing exact algorithms is Branch and Reduce. The approach Measure and Conquer is a powerful method used to analyze the worst case running time of

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Measure-and-conquer"

1

van Rooij, Johan M. M., Jesper Nederlof, and Thomas C. van Dijk. "Inclusion/Exclusion Meets Measure and Conquer." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04128-0_50.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Fomin, Fedor V., Fabrizio Grandoni, and Dieter Kratsch. "Measure and Conquer: Domination – A Case Study." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11523468_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Downey, Rodney G., and Michael R. Fellows. "Iterative Compression, and Measure and Conquer, for Minimization Problems." In Texts in Computer Science. Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-5559-1_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Fomin, Fedor V., Fabrizio Grandoni, Artem V. Pyatkin, and Alexey A. Stepanov. "Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach." In Algorithms and Computation. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11602613_58.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Thießen, Thore, and Jan Vahrenhold. "Klee’s Measure Problem Made Oblivious." In LATIN 2022: Theoretical Informatics. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-20624-5_8.

Full text

Abstract:

AbstractWe study Klee’s measure problem — computing the volume of the union of n axis-parallel hyperrectangles in $$\mathbb {R}^d$$ R d — in the oblivious RAM (ORAM) setting. For this, we modify Chan’s algorithm [12] to guarantee memory access patterns and control flow independent of the input; this makes the resulting algorithm applicable to privacy-preserving computation over outsourced data and (secure) multi-party computation.For $$d = 2$$ d = 2 , we develop an oblivious version of Chan’s algorithm that runs in expected $$\mathcal {O}(n \log ^{5/3} n)$$ O ( n log 5 / 3 n ) time for perfect security or $$\mathcal {O}(n \log ^{3/2} n)$$ O ( n log 3 / 2 n ) time for computational security, thus improving over optimal general transformations. For $$d \ge 3$$ d ≥ 3 , we obtain an oblivious version with perfect security while maintaining the $$\mathcal {O}(n^{d/2})$$ O ( n d / 2 ) runtime, i. e., without any overhead.Generalizing our approach, we derive a technique to transform divide-and-conquer algorithms that rely on linear-scan processing into oblivious counterparts. As such, our results are of independent interest for geometric divide-and-conquer algorithms that maintain an order over the input. We apply our technique to two such algorithms and obtain efficient oblivious counterparts of algorithms for inversion counting and computing a closest pair in two dimensions.

APA, Harvard, Vancouver, ISO, and other styles

6

Wu, Bang Ye. "A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21398-9_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Huang, Chih-Yang, Po-Chuan Chien, and Yen Hung Chen. "A Measure and Conquer Algorithm for the Minimum User Spatial-Aware Interest Group Query Problem." In Communications in Computer and Information Science. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-9190-3_47.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gaspers, Serge, and Gregory B. Sorkin. "Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets." In Automata, Languages, and Programming. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47672-7_46.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wang, Pan, Yandi Zuo, Jiasen Wang, and Jian Zhang. "A Novel Cooperative Divide-and-Conquer Neural Networks Algorithm." In Advances in Library and Information Science. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-1786-4.ch011.

Full text

Abstract:

Dynamic modularity is one of the fundamental characteristics of the human brain. Cooperative divide and conquer strategy is a basic problem solving approach. This chapter proposes a new subnet training method for modular neural networks with the inspiration of the principle of “an expert with other capabilities.” The key point of this method is that a subnet learns the neighbor data sets while fulfilling its main task: learning the objective data set. Additionally, a relative distance measure is proposed to replace the absolute distance measure used in the classical method and its advantage is theoretically discussed. Both methodology and empirical study are presented. Two types of experiments respectively related with the approximation problem and the prediction problem in nonlinear dynamic systems are designed to verify the effectiveness of the proposed method. Compared with the classical learning method, the average testing error is dramatically decreased and more stable. The superiority of the relative distance measure is also corroborated. Finally, a mind-gut frame is proposed.

APA, Harvard, Vancouver, ISO, and other styles

10

Richman, Karen. "Who Owns the Religion of Haiti?" In Who Owns Haiti? University Press of Florida, 2017. http://dx.doi.org/10.5744/florida/9780813062266.003.0007.

Full text

Abstract:

“Who Owns the Religion of Haiti?” demonstrates how a futile religious ‘war’ has been waged in pursuit of control over elusive doctrinal boundaries and dubious doctrinal fidelity in a persistently fluid, plural religious landscape. Since 1860, the Vatican and French Catholic Church have waged crusades to conquer the cultural life of the nation and retake control of Haitian Catholicism. A century later, Protestant missionaries from the United States embarked on their own campaigns to accumulate converts in the Haitian countryside. During twentieth century ‘anti-superstition’ campaigns against vodou, and more recent post-earthquake iterations of anti-vodou campaigns, there has been a constant battle waged in Haiti over religion. Throughout, Haitians utilize diffuse, localized, and family-based features to provide a measure of immunity to the colonizing designs of religious crusaders.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Measure-and-conquer"

1

Fomin, Fedor V., Fabrizio Grandoni, and Dieter Kratsch. "Measure and conquer." In the seventeenth annual ACM-SIAM symposium. ACM Press, 2006. http://dx.doi.org/10.1145/1109557.1109560.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Shang, Haopu, Jia-Liang Wu, Wenjing Hong, and Chao Qian. "Neural Network Pruning by Cooperative Coevolution." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/667.

Full text

Abstract:

Neural network pruning is a popular model compression method which can significantly reduce the computing cost with negligible loss of accuracy. Recently, filters are often pruned directly by designing proper criteria or using auxiliary modules to measure their importance, which, however, requires expertise and trial-and-error. Due to the advantage of automation, pruning by evolutionary algorithms (EAs) has attracted much attention, but the performance is limited for deep neural networks as the search space can be quite large. In this paper, we propose a new filter pruning algorithm CCEP by co

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!