Relevant bibliographies by topics / 080201 Analysis of Algorithms and Complexity

Academic literature on the topic '080201 Analysis of Algorithms and Complexity'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic '080201 Analysis of Algorithms and Complexity.'

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 "080201 Analysis of Algorithms and Complexity"

1

Hower, Walter. "Constraint satisfaction — Algorithms and complexity analysis." Information Processing Letters 55, no. 3 (August 1995): 171–78. http://dx.doi.org/10.1016/0020-0190(95)00089-u.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

BARMAK, OLEXANDER, PAVLO RADIUK, MARYNA MOLCHANOVA, and OLENA SOBKO. "APPROACHES TO PRACTICAL ANALYSIS OF COMPUTING ALGORITHMS." Herald of Khmelnytskyi National University 303, no. 6 (December 2021): 102–5. http://dx.doi.org/10.31891/2307-5732-2021-303-6-102-105.

Full text
Abstract:
The present work proposes a practical approach to determining the main types of algorithms, depending on their effectiveness in the appearance of the software code. Examples of analysis of the software code for computational complexity are given in the order of reducing the efficiency supplied as (in asymptotic designations): O(1), O(LogN), O(N), O(NlogN), O(N2), O(N2), O(N2), O(N3). The research task was to analyze the software code and specific conditions in which the algorithm refers to a particular type of computational complexity. The aim of analyzing the complexity of algorithms is to find the optimal algorithm for solving a specific problem. The criterion of optimality of the algorithm is chosen by the complexity of the algorithm, i.e., the number of elementary operations that must be performed to solve the problem using this algorithm. The complexity function is the ratio that connects the algorithm’s input data with the number of elementary operations. The paper contains a description of classical computational complexity that can be revealed by visual analysis of program code. The main types of computational complexity are (listed in descending order of efficiency) constant, logarithmic, linear, linear-logarithmic, quadratic, cubic. Also, methods for the determination of computational complexity are described. It is established that the main factors that can assess the algorithm’s computational complexity for the visual analysis of the software code are the presence of cycles, especially enclosed, reversibility of the algorithm, etc. Further research could usefully explore a method of semantic analysis of program code to predict the assessment of its computational complexity.
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Xinjia, Kemin Zhou, and Jorge Aravena. "Probabilistic Robustness Analysis—Risks, Complexity, and Algorithms." SIAM Journal on Control and Optimization 47, no. 5 (January 2008): 2693–723. http://dx.doi.org/10.1137/060668407.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hagiya, Masami, John A. Rose, Ken Komiya, and Kensaku Sakamoto. "Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms." Theoretical Computer Science 287, no. 1 (September 2002): 59–71. http://dx.doi.org/10.1016/s0304-3975(02)00095-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Faran, Rachel, and Orna Kupferman. "A Parametrized Analysis of Algorithms on Hierarchical Graphs." International Journal of Foundations of Computer Science 30, no. 06n07 (September 2019): 979–1003. http://dx.doi.org/10.1142/s0129054119400252.

Full text
Abstract:
Hierarchical graphs are used in order to describe systems with a sequential composition of sub-systems. A hierarchical graph consists of a vector of subgraphs. Vertices in a subgraph may “call” other subgraphs. The reuse of subgraphs, possibly in a nested way, causes hierarchical graphs to be exponentially more succinct than equivalent flat graphs. Early research on hierarchical graphs and the computational price of their succinctness suggests that there is no strong correlation between the complexity of problems when applied to flat graphs and their complexity in the hierarchical setting. That is, the complexity in the hierarchical setting is higher, but all “jumps” in complexity up to an exponential one are exhibited, including no jumps in some problems. We continue the study of the complexity of algorithms for hierarchical graphs, with the following contributions: (1) In many applications, the subgraphs have a small, often a constant, number of exit vertices, namely vertices from which control returns to the calling subgraph. We offer a parameterized analysis of the complexity and point to problems where the complexity becomes lower when the number of exit vertices is bounded by a constant. (2) We describe a general methodology for algorithms on hierarchical graphs. The methodology is based on an iterative compression of subgraphs in a way that maintains the solution to the problems and results in subgraphs whose size depends only on the number of exit vertices, and (3) we handle labeled hierarchical graphs, where edges are labeled by letters from some alphabet, and the problems refer to the languages of the graphs.
APA, Harvard, Vancouver, ISO, and other styles
6

Douglas, B. L., and J. B. Wang. "Complexity Analysis of Quantum Walk Based Search Algorithms." Journal of Computational and Theoretical Nanoscience 10, no. 7 (July 1, 2013): 1601–5. http://dx.doi.org/10.1166/jctn.2013.3095.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lin, M. S., M. S. Chang, and D. J. Chen. "Distributed-program reliability analysis: complexity and efficient algorithms." IEEE Transactions on Reliability 48, no. 1 (March 1999): 87–95. http://dx.doi.org/10.1109/24.765932.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zakarauskas, P., and J. M. Ozard. "Complexity analysis for partitioning nearest neighbor searching algorithms." IEEE Transactions on Pattern Analysis and Machine Intelligence 18, no. 6 (June 1996): 663–68. http://dx.doi.org/10.1109/34.506419.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Barik, Somsubhra, and Haris Vikalo. "Sparsity-Aware Sphere Decoding: Algorithms and Complexity Analysis." IEEE Transactions on Signal Processing 62, no. 9 (May 2014): 2212–25. http://dx.doi.org/10.1109/tsp.2014.2307836.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Jiang, Tao, Ming Li, and Paul M. B. Vitányi. "Average-case analysis of algorithms using Kolmogorov complexity." Journal of Computer Science and Technology 15, no. 5 (September 2000): 402–8. http://dx.doi.org/10.1007/bf02950402.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "080201 Analysis of Algorithms and Complexity"

1

Richey, Michael Bruce. "Combinatorial optimization on series-parallel graphs : algorithms and complexity." Diss., Georgia Institute of Technology, 1985. http://hdl.handle.net/1853/24542.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nordin, Henrik, and Kevin Jouper. "Performance analysis of multithreaded sorting algorithms." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10404.

Full text
Abstract:
Context. Almost all of the modern computers today have a CPU withmultiple cores, providing extra computational power. In the new ageof big data, parallel execution is essential to improve the performanceto an acceptable level. With parallelisation comes new challenges thatneeds to be considered. Objectives. In this work, parallel algorithms are compared and analysedin relation to their sequential counterparts, using the Java platform.Through this, find the potential speedup for multithreading andwhat factors affects the performance. In addition, provide source codefor multithreaded algorithms with proven time complexities. Methods. A literature study was conducted to gain knowledge anddeeper understanding into the aspects of sorting algorithms and thearea of parallel computing. An experiment followed of implementing aset of algorithms from which data could be gather through benchmarkingand testing. The data gathered was studied and analysed with itscorresponding source code to prove the validity of parallelisation. Results. Multithreading does improve performance, with two threadsin average providing a speedup of up to 2x and four threads up to3x. However, the potential speedup is bound to the available physicalthreads of the CPU and dependent of balancing the workload. Conclusions. The importance of workload balancing and using thecorrect number of threads in relation to the problem to be solved,needs to be carefully considered in order to utilize the extra resourcesavailable to its full potential.
APA, Harvard, Vancouver, ISO, and other styles
3

Castura, Jeff. "Performance analysis and optimization of reduced complexity Low Density Parity Check decoding algorithms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0017/MQ53426.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Powell, David Richard 1973. "Algorithms for sequence alignment." Monash University, School of Computer Science and Software Engineering, 2001. http://arrow.monash.edu.au/hdl/1959.1/8051.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Philips, Petra Camilla, and petra philips@gmail com. "Data-Dependent Analysis of Learning Algorithms." The Australian National University. Research School of Information Sciences and Engineering, 2005. http://thesis.anu.edu.au./public/adt-ANU20050901.204523.

Full text
Abstract:
This thesis studies the generalization ability of machine learning algorithms in a statistical setting. It focuses on the data-dependent analysis of the generalization performance of learning algorithms in order to make full use of the potential of the actual training sample from which these algorithms learn.¶ First, we propose an extension of the standard framework for the derivation of generalization bounds for algorithms taking their hypotheses from random classes of functions. This approach is motivated by the fact that the function produced by a learning algorithm based on a random sample of data depends on this sample and is therefore a random function. Such an approach avoids the detour of the worst-case uniform bounds as done in the standard approach. We show that the mechanism which allows one to obtain generalization bounds for random classes in our framework is based on a “small complexity” of certain random coordinate projections. We demonstrate how this notion of complexity relates to learnability and how one can explore geometric properties of these projections in order to derive estimates of rates of convergence and good confidence interval estimates for the expected risk. We then demonstrate the generality of our new approach by presenting a range of examples, among them the algorithm-dependent compression schemes and the data-dependent luckiness frameworks, which fall into our random subclass framework.¶ Second, we study in more detail generalization bounds for a specific algorithm which is of central importance in learning theory, namely the Empirical Risk Minimization algorithm (ERM). Recent results show that one can significantly improve the high-probability estimates for the convergence rates for empirical minimizers by a direct analysis of the ERM algorithm. These results are based on a new localized notion of complexity of subsets of hypothesis functions with identical expected errors and are therefore dependent on the underlying unknown distribution. We investigate the extent to which one can estimate these high-probability convergence rates in a data-dependent manner. We provide an algorithm which computes a data-dependent upper bound for the expected error of empirical minimizers in terms of the “complexity” of data-dependent local subsets. These subsets are sets of functions of empirical errors of a given range and can be determined based solely on empirical data. We then show that recent direct estimates, which are essentially sharp estimates on the high-probability convergence rate for the ERM algorithm, can not be recovered universally from empirical data.
APA, Harvard, Vancouver, ISO, and other styles
6

Ho, Lester Tse Wee. "Self-organising algorithms for fourth generation wireless networks and its analysis using complexity metrics." Thesis, Queen Mary, University of London, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.407388.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kenny, Robert. "Orbit complexity and computable Markov partitions." University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0231.

Full text
Abstract:
Markov partitions provide a 'good' mechanism of symbolic dynamics for uniformly hyperbolic systems, forming the classical foundation for the thermodynamic formalism in this setting, and remaining useful in the modern theory. Usually, however, one takes Bowen's 1970's general construction for granted, or restricts to cases with simpler geometry (as on surfaces) or more algebraic structure. This thesis examines several questions on the algorithmic content of (topological) Markov partitions, starting with the pointwise, entropy-like, topological conjugacy invariant known as orbit complexity. The relation between orbit complexity de nitions of Brudno and Galatolo is examined in general compact spaces, and used in Theorem 2.0.9 to bound the decrease in some of these quantities under semiconjugacy. A corollary, and a pointwise analogue of facts about metric entropy, is that any Markov partition produces symbolic dynamics matching the original orbit complexity at each point. A Lebesgue-typical value for orbit complexity near a hyperbolic attractor is also established (with some use of Brin-Katok local entropy), and is technically distinct from typicality statements discussed by Galatolo, Bonanno and their co-authors. Both our results are proved adapting classical arguments of Bowen for entropy. Chapters 3 and onwards consider the axiomatisation and computable construction of Markov partitions. We propose a framework of 'abstract local product structures'
APA, Harvard, Vancouver, ISO, and other styles
8

Wei, Ke. "Efficient algorithms for compressed sensing and matrix completion." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:0e2e72fb-dd0c-457b-a0a5-f91c5212f5f5.

Full text
Abstract:
Compressed sensing and matrix completion are two new data acquisition techniques whose efficiency is achieved by exploring low dimensional structures in high dimensional data. Despite the combinatorial nature of compressed sensing and matrix completion, there has been significant development of computationally efficient algorithms which can produce accurate desired solutions to these problems. In this thesis, we are concerned with the development of low per iteration computational complexity algorithms for compressed sensing and matrix completion. First, we derive a locally optimal stepsize selection rule for the simplest iterative hard thresholding algorithm for matrix completion, and obtain a simple yet efficient algorithm. It is observed to have average case performance superior in some aspects to other matrix completion algorithms. To balance the fast convergence rates of more sophisticated recovery algorithms with the low per iteration computational cost of simple line-search algorithms, we introduce a family of conjugate gradient iterative hard thresholding algorithms for both compressed sensing and matrix completion. The theoretical results establish recovery guarantees for the restarted and projected variants of the algorithms, while the empirical performance comparisons establish significant computational advantages of the proposed methods over other hard thresholding algorithms. Finally, we introduce an alternating steepest descent method and a scaled variant especially designed for the matrix completion problem based on a simple factorization model of the low rank matrix. The computational efficacy of this method is achieved by reducing the high per iteration computational cost of the second order method and fully exploring the numerical linear algebra structure in the algorithm. Empirical evaluations establish the effectiveness of the proposed algorithms, compared with other state-of-the-art algorithms.
APA, Harvard, Vancouver, ISO, and other styles
9

Starrett, Dean. "Optimal Alignment of Multiple Sequence Alignments." Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/194840.

Full text
Abstract:
An essential tool in biology is the alignment of multiple sequences. Biologists use multiple sequence alignments for tasks such as predicting protein structure and function, reconstructing phylogenetic trees, and finding motifs. Constructing high-quality multiple alignments is computationally hard, both in theory and in practice, and is typically done using heuristic methods. The majority of state-of-the-art multiple alignment programs employ a form and polish strategy, where in the construction phase, an initial multiple alignment is formed by progressively merging smaller alignments, starting with single sequences. Then in a local-search phase, the resulting alignment is polished by repeatedly splitting it into smaller alignments and re-merging. This merging of alignments, the basic computational problem in the construction and local-search phases of the best multiple alignment heuristics, is called the Aligning Alignments Problem. Under the sum-of-pairs objective for scoring multiple alignments, this problem may seem to be a simple extension of two-sequence alignment. It is proven here, however, that with affine gap costs (which are recognized as necessary to get biologically-informative alignments) the problem is NP-complete when gaps are counted exactly. Interestingly, this form of multiple alignment is polynomial-time solvable when we relax the exact count, showing that exact gap counts themselves are inherently hard in multiple sequence alignment. Unlike general multiple alignment however, we show that Aligning Alignments with affine gap costs and exact counts is tractable in practice, by demonstrating an effective algorithm and a fast implementation. Our software AlignAlign is both time- and space-efficient on biological data. Computational experiments on biological data show instances derived from standard benchmark suites can be optimally aligned with surprising efficiency, and experiments on simulated data show the time and space both scale well.
APA, Harvard, Vancouver, ISO, and other styles
10

Osbild, Ralf Verfasser], and Kurt [Akademischer Betreuer] [Mehlhorn. "General analysis tool box for controlled perturbation algorithms and complexity and computation of Θ-guarded regions / Ralf Osbild. Betreuer: Kurt Mehlhorn." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2013. http://d-nb.info/1053634994/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "080201 Analysis of Algorithms and Complexity"

1

Goodwin, Roger. Algorithm complexity: Analysis and theory. 2nd ed. Norfolk, VA (P.O. Box 8235, Norfolk 23503-0235): Old Dominion Press, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

1939-, Steiglitz Kenneth, ed. Combinatorial optimization: Algorithms and complexity. Mineola, N.Y: Dover Publications, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Algorithms: Their complexity and efficiency. 2nd ed. Chichester: Wiley, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Borodin, Allan. Online computation and competitive analysis. Cambridge, [Eng.]: Cambridge University Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Alexander, Ostermann, ed. Analysis for computer scientists: Foundations, methods, and algorithms. London: Springer-Verlag, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kuhn, Peter. Algorithms, Complexity Analysis and VLSI Architectures for MPEG-4 Motion Estimation. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-4474-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dieter, Kratsch, and SpringerLink (Online service), eds. Exact Exponential Algorithms. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Castura, Jeff. Performance analysis and optimization of reduced complexity low density parity check decoding algorithms. Ottawa: National Library of Canada, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wassenhove, Luk N. van. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Fontainebleau: INSEAD, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Çela, Eranda. The Quadratic Assignment Problem: Theory and Algorithms. Boston, MA: Springer US, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "080201 Analysis of Algorithms and Complexity"

1

Ausiello, Giorgio, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, and Viggo Kann. "Probabilistic analysis of approximation algorithms." In Complexity and Approximation, 287–320. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-58412-1_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kozen, Dexter C. "Algorithms and Their Complexity." In The Design and Analysis of Algorithms, 3–8. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-4400-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kuhn, Peter. "Complexity Analysis Methodology." In Algorithms, Complexity Analysis and VLSI Architectures for MPEG-4 Motion Estimation, 61–92. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-4474-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Ming, and Paul Vitányi. "Average-Case Analysis Using Kolmogorov Complexity." In Advances in Algorithms, Languages, and Complexity, 157–69. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4613-3394-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sani, Habiba Muhammad, Ci Lei, and Daniel Neagu. "Computational Complexity Analysis of Decision Tree Algorithms." In Lecture Notes in Computer Science, 191–97. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04191-5_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Razgon, Igor. "Complexity Analysis of Heuristic CSP Search Algorithms." In Lecture Notes in Computer Science, 88–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11754602_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Faran, Rachel, and Orna Kupferman. "A Parametrized Analysis of Algorithms on Hierarchical Graphs." In Descriptional Complexity of Formal Systems, 114–27. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-60252-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Grimm, José. "Complexity Analysis of Automatic Differentiation in the Hyperion Software." In Automatic Differentiation of Algorithms, 305–10. New York, NY: Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4613-0075-5_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lackner, Martin, and Piotr Skowron. "Algorithms and Computational Complexity." In SpringerBriefs in Intelligent Systems, 79–93. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09016-5_5.

Full text
Abstract:
AbstractIn this chapter, we discuss computational problems related to ABC rules and algorithms that solve these problems. We start by discussing the computational complexity of ABC rules. As many ABC rules are computationally difficult, a thorough algorithmic analysis is paramount to a practical application of these rules.
APA, Harvard, Vancouver, ISO, and other styles
10

Avanzini, Martin, Georg Moser, and Michael Schaper. "TcT: Tyrolean Complexity Tool." In Tools and Algorithms for the Construction and Analysis of Systems, 407–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49674-9_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "080201 Analysis of Algorithms and Complexity"

1

Neumann, Frank, and Andrew M. Sutton. "Parameterized Complexity Analysis of Evolutionary Algorithms." In GECCO '15: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2739482.2756562.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Neumann, Frank, and Andrew M. Sutton. "Parameterized complexity analysis of evolutionary algorithms." In GECCO '14: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2598394.2605351.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kulcke, Matthias, and Wolfgang Lorenz. "Utilizing Gradient Analysis within Interactive Genetic Algorithms." In eCAADe 2016: Complexity & Simplicity. eCAADe, 2016. http://dx.doi.org/10.52842/conf.ecaade.2016.2.359.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Maciel, Tarcisio F., and Anja Klein. "A performance-complexity analysis of four suboptimal SDMA algorithms." In 2008 International ITG Workshop on Smart Antennas. IEEE, 2008. http://dx.doi.org/10.1109/wsa.2008.4475563.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hoefler, Torsten, and Grzegorz Kwasniewski. "Automatic complexity analysis of explicitly parallel programs." In SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2612669.2612685.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rahaman, Sadiqur, Shahnewaz Shahabuddin, Md Belayat Hossain, and Shahriar Shahabuddin. "Complexity analysis of matrix decomposition algorithms for linear MIMO detection." In 2016 International Conference on Informatics, Electronics and Vision (ICIEV). IEEE, 2016. http://dx.doi.org/10.1109/iciev.2016.7760136.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Prozorov, Dmitriy, and Alexandra Tatarinova. "Analysis of the Computational Complexity of Algorithms for Phonemic Transcription." In 2018 IEEE East-West Design & Test Symposium (EWDTS). IEEE, 2018. http://dx.doi.org/10.1109/ewdts.2018.8524701.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Smith, Peter, Tim King, Lee Garth, and Mischa Dohler. "An Analysis of Low Complexity Algorithms for MIMO Antenna Selection." In 2006 IEEE International Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/icc.2006.254941.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ferreira, Tais Borges, Marcia Aparecida Fernandes, and Rivalino Matias Jr. "A Comprehensive Complexity Analysis of User-Level Memory Allocator Algorithms." In 2012 Brazilian Symposium on Computing System Engineering (SBESC). IEEE, 2012. http://dx.doi.org/10.1109/sbesc.2012.27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sinchana, G. S., Sneha Padaki, Veena Ravi, Velury Suguna Varshini, and C. G. Raghavendra. "Software Implementation of FFT Algorithms and Analysis of their Computational Complexity." In 2018 Third International Conference on Electrical, Electronics, Communication, Computer Technologies and Optimization Techniques (ICEECCOT). IEEE, 2018. http://dx.doi.org/10.1109/iceeccot43722.2018.9001665.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "080201 Analysis of Algorithms and Complexity"

1

Luo, Zhi-Quan. Complexity Analysis and Algorithms for Optimal Resource Allocation in Wireless Networks. Fort Belvoir, VA: Defense Technical Information Center, September 2012. http://dx.doi.org/10.21236/ada579191.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ariyawansa, K. A. Low-Complexity Interior Point Algorithms for Stochastic Programming: Derivation Analysis and Performance Evaluation. Fort Belvoir, VA: Defense Technical Information Center, January 2000. http://dx.doi.org/10.21236/ada418278.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Soloviev, Vladimir, Victoria Solovieva, Anna Tuliakova, Alexey Hostryk, and Lukáš Pichl. Complex networks theory and precursors of financial crashes. [б. в.], October 2020. http://dx.doi.org/10.31812/123456789/4119.

Full text
Abstract:
Based on the network paradigm of complexity in the work, a systematic analysis of the dynamics of the largest stock markets in the world and cryptocurrency market has been carried out. According to the algorithms of the visibility graph and recurrence plot, the daily values of stock and crypto indices are converted into a networks and multiplex networks, the spectral and topological properties of which are sensitive to the critical and crisis phenomena of the studied complex systems. This work is the first to investigate the network properties of the crypto index CCI30 and the multiplex network of key cryptocurrencies. It is shown that some of the spectral and topological characteristics can serve as measures of the complexity of the stock and crypto market, and their specific behaviour in the pre-crisis period is used as indicators- precursors of critical phenomena.
APA, Harvard, Vancouver, ISO, and other styles
4

Perdigão, Rui A. P. Information physics and quantum space technologies for natural hazard sensing, modelling and prediction. Meteoceanics, September 2021. http://dx.doi.org/10.46337/210930.

Full text
Abstract:
Disruptive socio-natural transformations and climatic change, where system invariants and symmetries break down, defy the traditional complexity paradigms such as machine learning and artificial intelligence. In order to overcome this, we introduced non-ergodic Information Physics, bringing physical meaning to inferential metrics, and a coevolving flexibility to the metrics of information transfer, resulting in new methods for causal discovery and attribution. With this in hand, we develop novel dynamic models and analysis algorithms natively built for quantum information technological platforms, expediting complex system computations and rigour. Moreover, we introduce novel quantum sensing technologies in our Meteoceanics satellite constellation, providing unprecedented spatiotemporal coverage, resolution and lead, whilst using exclusively sustainable materials and processes across the value chain. Our technologies bring out novel information physical fingerprints of extreme events, with recently proven records in capturing early warning signs for extreme hydro-meteorologic events and seismic events, and do so with unprecedented quantum-grade resolution, robustness, security, speed and fidelity in sensing, processing and communication. Our advances, from Earth to Space, further provide crucial predictive edge and added value to early warning systems of natural hazards and long-term predictions supporting climatic security and action.
APA, Harvard, Vancouver, ISO, and other styles
5

Rigotti, Christophe, and Mohand-Saïd Hacid. Representing and Reasoning on Conceptual Queries Over Image Databases. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.89.

Full text
Abstract:
The problem of content management of multimedia data types (e.g., image, video, graphics) is becoming increasingly important with the development of advanced multimedia applications. Traditional database management systems are inadequate for the handling of such data types. They require new techniques for query formulation, retrieval, evaluation, and navigation. In this paper we develop a knowledge-based framework for modeling and retrieving image data by content. To represent the various aspects of an image object's characteristics, we propose a model which consists of three layers: (1) Feature and Content Layer, intended to contain image visual features such as contours, shapes,etc.; (2) Object Layer, which provides the (conceptual) content dimension of images; and (3) Schema Layer, which contains the structured abstractions of images, i.e., a general schema about the classes of objects represented in the object layer. We propose two abstract languages on the basis of description logics: one for describing knowledge of the object and schema layers, and the other, more expressive, for making queries. Queries can refer to the form dimension (i.e., information of the Feature and Content Layer) or to the content dimension (i.e., information of the Object Layer). These languages employ a variable free notation, and they are well suited for the design, verification and complexity analysis of algorithms. As the amount of information contained in the previous layers may be huge and operations performed at the Feature and Content Layer are time-consuming, resorting to the use of materialized views to process and optimize queries may be extremely useful. For that, we propose a formal framework for testing containment of a query in a view expressed in our query language. The algorithm we propose is sound and complete and relatively efficient.
APA, Harvard, Vancouver, ISO, and other styles
6

Rigotti, Christophe, and Mohand-Saïd Hacid. Representing and Reasoning on Conceptual Queries Over Image Databases. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.89.

Full text
Abstract:
The problem of content management of multimedia data types (e.g., image, video, graphics) is becoming increasingly important with the development of advanced multimedia applications. Traditional database management systems are inadequate for the handling of such data types. They require new techniques for query formulation, retrieval, evaluation, and navigation. In this paper we develop a knowledge-based framework for modeling and retrieving image data by content. To represent the various aspects of an image object's characteristics, we propose a model which consists of three layers: (1) Feature and Content Layer, intended to contain image visual features such as contours, shapes,etc.; (2) Object Layer, which provides the (conceptual) content dimension of images; and (3) Schema Layer, which contains the structured abstractions of images, i.e., a general schema about the classes of objects represented in the object layer. We propose two abstract languages on the basis of description logics: one for describing knowledge of the object and schema layers, and the other, more expressive, for making queries. Queries can refer to the form dimension (i.e., information of the Feature and Content Layer) or to the content dimension (i.e., information of the Object Layer). These languages employ a variable free notation, and they are well suited for the design, verification and complexity analysis of algorithms. As the amount of information contained in the previous layers may be huge and operations performed at the Feature and Content Layer are time-consuming, resorting to the use of materialized views to process and optimize queries may be extremely useful. For that, we propose a formal framework for testing containment of a query in a view expressed in our query language. The algorithm we propose is sound and complete and relatively efficient.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic '080201 Analysis of Algorithms and Complexity' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography