Добірка наукової літератури з теми "Repeated Matchings"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Repeated Matchings".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Repeated Matchings"
Friedman, Daniel, and Ryan Oprea. "A Continuous Dilemma." American Economic Review 102, no. 1 (February 1, 2012): 337–63. http://dx.doi.org/10.1257/aer.102.1.337.
Повний текст джерелаSerafine, Mary Louise, Noah Glassman, and Cornell Overbeeke. "The Cognitive Reality of Hierarchic Structure in Music." Music Perception 6, no. 4 (1989): 397–430. http://dx.doi.org/10.2307/40285440.
Повний текст джерелаLópez-Ortiz, Alejandro. "Linear pattern matching of repeated substrings." ACM SIGACT News 25, no. 3 (September 1994): 114–21. http://dx.doi.org/10.1145/193820.193842.
Повний текст джерелаWark, Peter, John Holt, Mikael Rönnqvist, and David Ryan. "Aircrew schedule generation using repeated matching." European Journal of Operational Research 102, no. 1 (October 1997): 21–35. http://dx.doi.org/10.1016/s0377-2217(96)00225-1.
Повний текст джерелаHonhon, Dorothée, and Kyle Hyndman. "Flexibility and Reputation in Repeated Prisoner’s Dilemma Games." Management Science 66, no. 11 (November 2020): 4998–5014. http://dx.doi.org/10.1287/mnsc.2019.3495.
Повний текст джерелаMingyan Wang, Mingyan Wang, Qingrong Huang Mingyan Wang, Nan Wu Qingrong Huang, and Ying Pan Nan Wu. "RDF Subgraph Matching by Means of Star Decomposition." 網際網路技術學刊 23, no. 7 (December 2022): 1613–21. http://dx.doi.org/10.53106/160792642022122307015.
Повний текст джерелаSchumacher, Heiner. "On Repeated Games with Endogenous Matching Decision." Journal of Institutional and Theoretical Economics 171, no. 3 (2015): 544. http://dx.doi.org/10.1628/093245615x14302136524716.
Повний текст джерелаBishop, Nicholas, Hau Chan, Debmalya Mandal, and Long Tran-Thanh. "Sequential Blocked Matching." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (June 28, 2022): 4834–42. http://dx.doi.org/10.1609/aaai.v36i5.20411.
Повний текст джерелаKim, Hee Chun. "Repeated Two-Sided Matching with Multi-Attribute Preference." Korean Journal of Industrial Organization 27, no. 4 (December 31, 2019): 87–121. http://dx.doi.org/10.36354/kjio.27.4.3.
Повний текст джерелаXu, Zhenzhen, and John D. Kalbfleisch. "Repeated Randomization and Matching in Multi-Arm Trials." Biometrics 69, no. 4 (October 17, 2013): 949–59. http://dx.doi.org/10.1111/biom.12077.
Повний текст джерелаДисертації з теми "Repeated Matchings"
Li, Chih-Lin. "Propensity Score Matching in Observational Studies with Multiple Time Points." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1313420291.
Повний текст джерелаWhiteford, Nava. "String matching in DNA sequences : implications for short read sequencing and repeat visualisation." Thesis, University of Southampton, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.438668.
Повний текст джерелаValero, Daniel. "Wireless Signal Conditioning." Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc862776/.
Повний текст джерелаOluwaniyi, Emmanuel Dejo. "Effectiveness of Prisoner Reentry Programs for Reduction of Repeat Incarcerations in Nigeria." ScholarWorks, 2017. https://scholarworks.waldenu.edu/dissertations/4317.
Повний текст джерелаNarang, Shivika. "Algorithms for Achieving Fairness and Efficiency in Matching Problems." Thesis, 2023. https://etd.iisc.ac.in/handle/2005/6140.
Повний текст джерелаTata Consultancy Services
Gat, Christopher. "Feature-based matching in historic repeat photography: an evaluation and assessment of feasibility." Thesis, 2011. http://hdl.handle.net/1828/3461.
Повний текст джерелаGraduate
Περδικούρη, Αικατερίνη. "Αλγόριθμοι διαχείρισης και ανάλυσης ακολουθιών βιολογικών δεδομένων με εφαρμογή σε προβλήματα βιοπληροφορικής". Thesis, 2006. http://nemertes.lis.upatras.gr/jspui/handle/10889/1415.
Повний текст джерелаThe object of this doctoral thesis is the study and the design of efficient algorithms for the analysis of sequences of biological data. The algorithms that we describe have application on Bioinformatics problems, such as the recognition of known or unknown patterns in DNA and RNA that are involved in various biological activities, as well as the discovery of periodicities. More specifically the algorithms that we present are used for the analysis of Biological Sequences with “don't care characters”' and Weighted Biological Sequences. Biological Sequences with “don't care characters”, usually represent protein families while Weighted Biological Sequences represent assembled sequences of genomes that they have been recently sequenced. In Biological Sequences with “don't care characters”' we present two efficient algorithms of linear time for the computation of the period and the cover. The second algorithm is also applied in circular DNAs . In Weighted Biological Sequences we present two algorithms for the computation of basic periodicities: the period and the cover, while we also solve the problem of pattern matching. The need for efficient management of biological sequences with weights prompted us to introduce a new efficient data structure which solves efficiently the two precedents problems. This structure is named Weighted Suffix Tree. Using the Weighted Suffix Tree we solve various instances of the motif discovery problem in Biological Weighted Sequences. Finally we decided to study the use of Genetic Algorithms and Evolutionary Programming in the analysis of biological sequences. The result of this study is the description of a genetic algorithm that computes the repetitions in a biological sequence.
Частини книг з теми "Repeated Matchings"
Batzoglou, Serafim, and Sorin Istrail. "Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem." In Combinatorial Pattern Matching, 66–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48452-3_5.
Повний текст джерелаThiemann, Peter. "Avoiding repeated tests in pattern matching." In Static Analysis, 141–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57264-3_36.
Повний текст джерелаṢahinalp, S. Cenk, Evan Eichler, Paul Goldberg, Petra Berenbrink, Tom Friedetzky, and Funda Ergun. "Statistical Identification of Uniformly Mutated Segments within Repeats." In Combinatorial Pattern Matching, 249–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45452-7_21.
Повний текст джерелаKolpakov, Roman, Mikhail Podolskiy, Mikhail Posypkin, and Nickolay Khrapov. "Searching of Gapped Repeats and Subrepetitions in a Word." In Combinatorial Pattern Matching, 212–21. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07566-2_22.
Повний текст джерелаSwidan, Firas, Michal Ziv-Ukelson, and Ron Y. Pinter. "On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem." In Combinatorial Pattern Matching, 141–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11780441_14.
Повний текст джерелаPonter, Alan R. S. "A Linear Matching Method for Shakedown Analysis." In Inelastic Behaviour of Structures under Variable Repeated Loads, 267–318. Vienna: Springer Vienna, 2002. http://dx.doi.org/10.1007/978-3-7091-2558-8_13.
Повний текст джерелаTurina, Andreas, Tinne Tuytelaars, Theo Moons, and Luc Van Gool. "Grouping via the Matching of Repeated Patterns." In Lecture Notes in Computer Science, 252–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44732-6_26.
Повний текст джерелаStoye, Jens, and Dan Gusfield. "Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version." In Combinatorial Pattern Matching, 140–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0030787.
Повний текст джерелаArratia, Richard, and Gesine Reinert. "Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization." In Combinatorial Pattern Matching, 209–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61258-0_16.
Повний текст джерелаSagot, Marie-France, and Alain Viari. "Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices." In Combinatorial Pattern Matching, 224–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63220-4_62.
Повний текст джерелаТези доповідей конференцій з теми "Repeated Matchings"
Sühr, Tom, Asia J. Biega, Meike Zehlike, Krishna P. Gummadi, and Abhijnan Chakraborty. "Two-Sided Fairness for Repeated Matchings in Two-Sided Markets." In KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3292500.3330793.
Повний текст джерелаIndow, Tarow. "Discrimination Ellipsoid of Surface Color." In Advances in Color Vision. Washington, D.C.: Optica Publishing Group, 1992. http://dx.doi.org/10.1364/acv.1992.sac5.
Повний текст джерелаBudinich, Michele, and Lance Fortnow. "Repeated matching pennies with limited randomness." In the 12th ACM conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1993574.1993592.
Повний текст джерелаLe Brese, Christopher, Ju Jia Zou, and Brian Uy. "An improved ASIFT algorithm for matching repeated patterns." In 2010 17th IEEE International Conference on Image Processing (ICIP 2010). IEEE, 2010. http://dx.doi.org/10.1109/icip.2010.5653485.
Повний текст джерелаYang, Hongtai, Xiang Li, Xiaotian Qin, Yanfen Jiang, and Fangfang Zheng. "User Matching Algorithm Based on Repeated Transfer Behavior." In 2021 6th International Conference on Transportation Information and Safety (ICTIS). IEEE, 2021. http://dx.doi.org/10.1109/ictis54573.2021.9798668.
Повний текст джерелаOlzak, Lynn A., and James P. Thomas. "Spatial frequency matching in complex stimuli." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1986. http://dx.doi.org/10.1364/oam.1986.thn2.
Повний текст джерелаZHANG, Yan, Yutao ZHAO, and Guangxu LI. "Robot Arm Repeated Positioning Accuracy Measurement Using Nonlinear Local Feature Matching." In 2018 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC). IEEE, 2018. http://dx.doi.org/10.1109/icspcc.2018.8567779.
Повний текст джерелаSchindler, Grant, Panchapagesan Krishnamurthy, Roberto Lublinerman, Yanxi Liu, and Frank Dellaert. "Detecting and matching repeated patterns for automatic geo-tagging in urban environments." In 2008 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2008. http://dx.doi.org/10.1109/cvpr.2008.4587461.
Повний текст джерелаDuan, XiaoRong, chenni dong, and xin ma. "Research and implementation of network defense and non-repeated substring pattern matching algorithm." In International Conference on Signal Processing and Communication Security (ICSPCS 2022), edited by Min Xiao and Lisu Yu. SPIE, 2022. http://dx.doi.org/10.1117/12.2655409.
Повний текст джерелаWu, Gang, and Chris Chu. "Simultaneous Slack Matching, Gate Sizing and Repeater Insertion for Asynchronous Circuits." In Proceedings of the 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE). Singapore: Research Publishing Services, 2016. http://dx.doi.org/10.3850/9783981537079_0307.
Повний текст джерела