Academic literature on the topic 'Discrete Sequences'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Discrete Sequences.'
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 "Discrete Sequences"
Pétermann, Y. F. S., Jean-Luc Rémy, and Ilan Vardi. "Discrete Derivatives of Sequences." Advances in Applied Mathematics 27, no. 2-3 (August 2001): 562–84. http://dx.doi.org/10.1006/aama.2001.0750.
Full textWang, Larry X. W., and Eve Y. Y. Yang. "Laguerre inequalities for discrete sequences." Advances in Applied Mathematics 139 (August 2022): 102357. http://dx.doi.org/10.1016/j.aam.2022.102357.
Full textThom, Andreas. "Convergent Sequences in Discrete Groups." Canadian Mathematical Bulletin 56, no. 2 (June 1, 2013): 424–33. http://dx.doi.org/10.4153/cmb-2011-155-3.
Full textIvanov, V. A., and G. I. Ivchenko. "Frequency tests for discrete sequences." Journal of Soviet Mathematics 39, no. 4 (November 1987): 2846–56. http://dx.doi.org/10.1007/bf01092335.
Full textHe, Tian-Xiao. "A-sequences, Z-sequence, and B-sequences of Riordan matrices." Discrete Mathematics 343, no. 3 (March 2020): 111718. http://dx.doi.org/10.1016/j.disc.2019.111718.
Full textGupal, N. A. "Methods of Numeration of Discrete Sequences." Cybernetics and Computer Technologies, no. 2 (June 30, 2021): 63–67. http://dx.doi.org/10.34229/2707-451x.21.2.6.
Full textBelov, Yurii, Tesfa Y. Mengestie, and Kristian Seip. "Discrete Hilbert transforms on sparse sequences." Proceedings of the London Mathematical Society 103, no. 1 (January 27, 2011): 73–105. http://dx.doi.org/10.1112/plms/pdq053.
Full textPereira, J. S., and H. J. A. da Silva. "Orthogonal perfect discrete Fourier transform sequences." IET Signal Processing 6, no. 2 (2012): 107. http://dx.doi.org/10.1049/iet-spr.2010.0195.
Full textWeigand, Hans-Georg. "Sequences—Basic elements for discrete mathematics." Zentralblatt für Didaktik der Mathematik 36, no. 3 (June 2004): 91–97. http://dx.doi.org/10.1007/bf02652776.
Full textMacCluer, Barbara D. "Uniformly discrete sequences in the ball." Journal of Mathematical Analysis and Applications 318, no. 1 (June 2006): 37–42. http://dx.doi.org/10.1016/j.jmaa.2005.05.029.
Full textDissertations / Theses on the topic "Discrete Sequences"
Bastos, Antonio Josefran de Oliveira. "Convergent Sequences of Discrete Structures and Testability." Universidade Federal do CearÃ, 2012. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7654.
Full textIn this work, we studied the recent theory of convergent graph sequences and its extensions to permutation and partially ordered sets with fix dimension. Weâve conjectured a lemma of weak regularity on intervals that, if this conjecture is true, we can extend this theory to ordered graphs, which are graphs such that there is a total order on its vertices. We show some interesting relations on permutation and partially ordered sets with ordered graphs. Then, we obtain another proof to the existence of limit objects for all convergent permutation sequences. We also proved that all hereditary property of either permutation or ordered graph is testable.
Neste trabalho, estudamos a teoria recente de convergÃncia de sequÃncias de grafos e suas extensÃes para permutaÃÃes e ordens parciais de dimensÃo fixa. Conjecturamos um lema de regularidade fraca de grafos em intervalos que, se for verdadeira, nos possibilita estender essa teoria para grafos ordenados, que sÃo grafos tais que existe uma ordem total entre os vÃrtices. Mostramos algumas relaÃÃes interessantes de permutaÃÃes e ordens parciais com grafos ordenados. Com isso, conseguimos uma prova alternativa para a existÃncia de objetos limites de qualquer sequÃncia convergente de permutaÃÃes. Provamos tambÃm que toda propriedade hereditÃria de permutaÃÃes ou grafos ordenados à testÃvel.
Adams, David Bruce. "Optimization Frameworks for Discrete Composite Laminate Stacking Sequences." Diss., Virginia Tech, 2005. http://hdl.handle.net/10919/28631.
Full textPh. D.
Nickson, Thomas. "Pattern formations with discrete waves and broadcasting sequences." Thesis, University of Liverpool, 2013. http://livrepository.liverpool.ac.uk/9817/.
Full textKnight, James Robert. "Discrete pattern matching over sequences and interval sets." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186432.
Full textSpadaro, Santi Gruenhage Gary F. "Discrete sets, free sequences and cardinal properties of topological spaces." Auburn, Ala, 2009. http://hdl.handle.net/10415/1757.
Full textBiyikoglu, Türker, Marc Hellmuth, and Josef Leydold. "Largest Eigenvalues of the Discrete p-Laplacian of Trees with Degree Sequences." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2009. http://epub.wu.ac.at/390/1/document.pdf.
Full textSeries: Research Report Series / Department of Statistics and Mathematics
Hollander, Michael Israel. "Linear numeration systems, finite beta expansions, and discrete spectrum of substitution dynamical systems /." Thesis, Connect to this title online; UW restricted, 1996. http://hdl.handle.net/1773/5747.
Full textQueiros, Julie. "Analyse des réseaux d'ordre supérieur consruits à partir de séquences historio-géographiques." Electronic Thesis or Diss., Nantes Université, 2024. http://www.theses.fr/2024NANU4018.
Full textNetwork analysis extracts information about a system from the relationships between its actors. These relationships can correspond to flows drawn from sequences of states (i.e. agent trajectories between these entities). Representing these data as graphs generally assumes that these trajectories respect the Markov property; only the current state is sufficient to determine an agent’s future state. Numerous studies have challenged this assumption and proposed other models that allow us to overcome it: higher-order networks or HON. In it, a state can be represented by different memory nodes encoding the states previously visited before arriving at the current state. A first problem addressed in this thesis is the construction of HON, which is a statistical modeling problem: finding a good compromise between model size and quality. We propose here a model of variable-order networks that is more parsimonious than ex- isting models. A second problem is the analysis of HON. An advantage often put forward is that classical graph algorithms can be used with few modifications. We show, in the case of centrality measures or graph clustering, that this is not the case and argue that algorithms should be adapted to models
Alli, Idd Pazi. "Channel estimation in mobile wireless systems." Thesis, KTH, Signalbehandling, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-98754.
Full textAntonini, Gianluca. "A discrete choice modeling framework for pedestrian walking behavior with application to human tracking in video sequences /." [S.l.] : [s.n.], 2006. http://library.epfl.ch/theses/?nr=3382.
Full textBooks on the topic "Discrete Sequences"
Charalambides, Ch A. Discrete q-distributions. Hoboken, New Jersey: John Wiley & Sons, 2016.
Find full textHemmings, Dan B. Arbitrage valuation of financial sequences in discrete time. Sheffield: Sheffield UniversityManagement School, 1991.
Find full textJonathan, Jedwab, and SpringerLink (Online service), eds. Sequences and Their Applications – SETA 2012: 7th International Conference, Waterloo, ON, Canada, June 4-8, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Find full textGuna, Seetharaman, Rao, T. R. N. 1933-, and United States. National Aeronautics and Space Administration., eds. Data compression of discrete sequence: A tree based approach using dynamic programming. [Washington, DC: National Aeronautics and Space Administration, 1994.
Find full textGuna, Seetharaman, Rao, T. R. N. 1933-, and United States. National Aeronautics and Space Administration., eds. Data compression of discrete sequence: A tree based approach using dynamic programming. [Washington, DC: National Aeronautics and Space Administration, 1994.
Find full textIdeal shrinking and expansion of discrete sequences. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1988.
Find full textCharalambides, Charalambos A. Discrete Q-Distributions. Wiley & Sons, Incorporated, John, 2016.
Find full textCharalambides, Charalambos A. Discrete Q-Distributions. Wiley & Sons, Incorporated, John, 2016.
Find full textCharalambides, Charalambos A. Discrete Q-Distributions. Wiley & Sons, Limited, John, 2016.
Find full textHelleseth, T. Sequences And Their Applications (Dimacs Series in Discrete Mathematics and Theoretical Computer Science). Springer, 2001.
Find full textBook chapters on the topic "Discrete Sequences"
Aggarwal, Charu C. "Mining Discrete Sequences." In Data Mining, 493–529. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-14142-8_15.
Full textAggarwal, Charu C. "Outlier Detection in Discrete Sequences." In Outlier Analysis, 311–44. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-47578-3_10.
Full textAggarwal, Charu C. "Outlier Detection in Discrete Sequences." In Outlier Analysis, 267–312. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-6396-2_9.
Full textNickson, Thomas, and Igor Potapov. "Discrete Discs and Broadcasting Sequences." In Unconventional Computation and Natural Computation, 235. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32894-7_23.
Full textGries, David, and Fred B. Schneider. "A Theory of Sequences." In A Logical Approach to Discrete Math, 251–64. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4757-3837-7_14.
Full textNormand, Nicolas, Robin Strand, and Pierre Evenou. "Digital Distances and Integer Sequences." In Discrete Geometry for Computer Imagery, 169–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37067-0_15.
Full textValtr, Pavel. "Generalizations of Davenport-Schinzel sequences." In Contemporary Trends in Discrete Mathematics, 349–89. Providence, Rhode Island: American Mathematical Society, 1999. http://dx.doi.org/10.1090/dimacs/049/25.
Full textDiaconis, Persi, Susan Holmes, Svante Janson, Steven P. Lalley, and Robin Pemantle. "Metrics on Compositions and Coincidences among Renewal Sequences." In Random Discrete Structures, 81–101. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0719-1_6.
Full textJerri, Abdul J. "Sequences and Difference Operators." In Linear Difference Equations with Discrete Transform Methods, 1–40. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-5657-9_1.
Full textBhansali, Anil, and Steven Skiena. "Analyzing integer sequences." In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1–16. Providence, Rhode Island: American Mathematical Society, 1994. http://dx.doi.org/10.1090/dimacs/015/01.
Full textConference papers on the topic "Discrete Sequences"
Zhan, Jun, Junqi Dai, Jiasheng Ye, Yunhua Zhou, Dong Zhang, Zhigeng Liu, Xin Zhang, et al. "AnyGPT: Unified Multimodal LLM with Discrete Sequence Modeling." In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 9637–62. Stroudsburg, PA, USA: Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.acl-long.521.
Full textGasparyan, Armenak Sokratovich. "Combinatorial identities over recurrent sequences." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-45.
Full textSaadat, Samaneh, and Gita Sukthankar. "Explaining Differences in Classes of Discrete Sequences." In 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT). IEEE, 2020. http://dx.doi.org/10.1109/wiiat50758.2020.00022.
Full textMazel, D. S., and M. H. Hayes. "Hidden-variable fractal interpolation of discrete sequences." In [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing. IEEE, 1991. http://dx.doi.org/10.1109/icassp.1991.150182.
Full textPettie, Seth. "Sharp Bounds on Formation-free Sequences." In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973730.40.
Full textQiao, Jie, Ruichu Cai, Siyu Wu, Yu Xiang, Keli Zhang, and Zhifeng Hao. "Structural Hawkes Processes for Learning Causal Structure from Discrete-Time Event Sequences." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/633.
Full textGiordano, Pola,. "Sequences of Discrete Abstractions for Piecewise Affine Systems." In Analysis and Design of Hybrid Systems, edited by Heemels, Maurice, chair Giua, Alessandro and Heemels, Maurice. IFAC, Elsevier, 2012. http://dx.doi.org/10.3182/20120606-3-nl-3011.00024.
Full textXylogiannopoulos, Konstantinos F., and Panagiotis Karampelas. "Visualization of Repeated Patterns in Multivariate Discrete Sequences." In 2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 2020. http://dx.doi.org/10.1109/asonam49781.2020.9381316.
Full textMakeev, Sergey Danilovich. "Hardly describable almost polynomial classes of requrrent sequences." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-36.
Full textOuaknine, Joël, and James Worrell. "Positivity Problems for Low-Order Linear Recurrence Sequences." In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973402.27.
Full textReports on the topic "Discrete Sequences"
Kozmina, Jelena, and Alytis Gruodis. Tool QUATTRO-20 for Examining of the Recurrent Sequencies Generated by Discrete Analogue of the Verhulst Equation. Publishing House - Vilnius Business College, June 2023. http://dx.doi.org/10.57005/ab.2023.1.3.
Full textAmengual, Dante, Xinyue Bei, Marine Carrasco, and Enrique Sentana. Score-type tests for normal mixtures. CIRANO, January 2023. http://dx.doi.org/10.54932/uxsg1990.
Full textRemington, Roger W., Shu-Chieh Wu, and Harold Pashler. Human Resource Scheduling in Performing a Sequence of Discrete Responses. Fort Belvoir, VA: Defense Technical Information Center, February 2009. http://dx.doi.org/10.21236/ada502763.
Full textRemington, Roger W., Shu-Chieh Wu, and Harold Pashler. Human Resource Scheduling in Performing a Sequence of Discrete Responses. Fort Belvoir, VA: Defense Technical Information Center, February 2007. http://dx.doi.org/10.21236/ada473629.
Full textAbbott, Albert G., Doron Holland, Douglas Bielenberg, and Gregory Reighard. Structural and Functional Genomic Approaches for Marking and Identifying Genes that Control Chilling Requirement in Apricot and Peach Trees. United States Department of Agriculture, September 2009. http://dx.doi.org/10.32747/2009.7591742.bard.
Full textWeinberg, Zwi G., Adegbola Adesogan, Itzhak Mizrahi, Shlomo Sela, Kwnag Jeong, and Diwakar Vyas. effect of selected lactic acid bacteria on the microbial composition and on the survival of pathogens in the rumen in context with their probiotic effects on ruminants. United States Department of Agriculture, January 2014. http://dx.doi.org/10.32747/2014.7598162.bard.
Full text