Zaloguj się

Gotowe bibliografie tematyczne / Repeated Matchings

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Części książek
Streszczenia konferencji

Gotowa bibliografia na temat „Repeated Matchings”

Autor: Grafiati

Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Repeated Matchings”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Repeated Matchings"

1

Friedman, Daniel, i Ryan Oprea. "A Continuous Dilemma". American Economic Review 102, nr 1 (1.02.2012): 337–63. http://dx.doi.org/10.1257/aer.102.1.337.

Pełny tekst źródła

Streszczenie:

We study prisoners' dilemmas played in continuous time with flow payoffs accumulated over 60 seconds. In most cases, the median rate of mutual cooperation is about 90 percent. Control sessions with repeated matchings over eight subperiods achieve less than half as much cooperation, and cooperation rates approach zero in one-shot sessions. In follow-up sessions with a variable number of subperiods, cooperation rates increase nearly linearly as the grid size decreases, and, with one-second subperiods, they approach continuous levels. Our data support a strand of theory that explains how capacity to respond rapidly stabilizes cooperation and destabilizes defection in the prisoner's dilemma. (JEL C72, C78, C91)

Style APA, Harvard, Vancouver, ISO itp.

2

Serafine, Mary Louise, Noah Glassman i Cornell Overbeeke. "The Cognitive Reality of Hierarchic Structure in Music". Music Perception 6, nr 4 (1989): 397–430. http://dx.doi.org/10.2307/40285440.

Pełny tekst źródła

Streszczenie:

Six experiments examined the cognitive reality of hierarchic structure in music. The first experiment showed that subjects were only moderately able to match a performed rendition of a hierarchic structure to the piece of music from which it was derived, with performance slightly better than chance. Metric accent emerged as a significant predictor of the tones perceived by subjects as structurally important. The second experiment showed that subjects' correct matchings were unlikely to be based on aesthetic preference, because performed renditions of (rule-governed) structures were not regarded as aesthetically preferable to nonstructures. The third experiment attempted to increase subjects' matching of structures and their original pieces through various task modifications, but these modifications did not increase performance over the success rate achieved in Experiment 1. Three additional experiments determined whether evidence of the distinction between structureand surface could be obtained in various similarity judgment tasks. Pairs of musical fragments were composed so that the members of each pair embodied (1) the same structure and same surface harmony, or (2) the same structure but different surface harmony, or (3) a different structure but same surface harmony. The rating task used in Experiments 4 and 5 showed that the members of Type-2 pairs of fragments were perceived to be just as similar as the members of Type-1 pairs, but Type-3 pairs were rated significantly lower in similarity. Thus, similarity judgments were based on underlying hierarchic structure, even in the face of radical harmony differences on the surface. This effect increased in strength with repeated hearing. The results support the cognitive reality of hierarchic structure, but are influenced by the type of perception used in a particular similarity judgment task and by the experience of repeated hearings.

Style APA, Harvard, Vancouver, ISO itp.

3

López-Ortiz, Alejandro. "Linear pattern matching of repeated substrings". ACM SIGACT News 25, nr 3 (wrzesień 1994): 114–21. http://dx.doi.org/10.1145/193820.193842.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Wark, Peter, John Holt, Mikael Rönnqvist i David Ryan. "Aircrew schedule generation using repeated matching". European Journal of Operational Research 102, nr 1 (październik 1997): 21–35. http://dx.doi.org/10.1016/s0377-2217(96)00225-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Honhon, Dorothée, i Kyle Hyndman. "Flexibility and Reputation in Repeated Prisoner’s Dilemma Games". Management Science 66, nr 11 (listopad 2020): 4998–5014. http://dx.doi.org/10.1287/mnsc.2019.3495.

Pełny tekst źródła

Streszczenie:

We study how three matching institutions, differing in how relationships are dissolved, affect cooperation in a repeated prisoner’s dilemma and how cooperation rates are affected by the presence of a reputation mechanism. Although cooperation is theoretically sustainable under all institutions, we show experimentally that cooperation rates are lowest under random matching, highest under fixed matching, and intermediate in a flexible matching institution, where subjects have the option to dissolve relationships. Our results also suggest important interactions between the matching institution and reputation mechanism. Under both the random matching and flexible matching institutions, both subjective (based on subjects’ ratings) and objective (based on subjects’ actions) reputation mechanisms lead to substantial increases in cooperative behavior. However, under fixed matching, only the subjective reputation mechanism leads to higher cooperation. We argue that these differences are due to different reputation mechanisms being more forgiving of early deviations from cooperation under certain matching institutions, which gives subjects the ability to learn the value of cooperation rather than getting stuck with a bad reputation and, consequently, uncooperative relationships. This paper was accepted by Yan Chen, decision analysis.

Style APA, Harvard, Vancouver, ISO itp.

6

Mingyan Wang, Mingyan Wang, Qingrong Huang Mingyan Wang, Nan Wu Qingrong Huang i Ying Pan Nan Wu. "RDF Subgraph Matching by Means of Star Decomposition". 網際網路技術學刊 23, nr 7 (grudzień 2022): 1613–21. http://dx.doi.org/10.53106/160792642022122307015.

Pełny tekst źródła

Streszczenie:

<p>With the continuous development of the network, the scale of RDF data is becoming larger and larger. In the face of large-scale RDF data processing, the traditional database query method has been unable to meet the needs. Due to the limited characteristics of subgraph matching, most existing algorithms often have the phenomenon that many subgraphs are repeatedly traversed during the query process, resulting in a large number of intermediate result sets and low query efficiency. The core problem to be solved is how to efficiently match subgraphs. In order to improve the query efficiency of RDF subgraphs in massive RDF data graphs and solve the problem of repeated calculation of some graphs in the query process of RDF subgraphs, an RDF subgraph query algorithm based on star decomposition is proposed in this paper. The algorithm uses graph structure to decompose RDF subgraphs into stars and uses a custom node cost model to calculate the query order of the star subgraphs. By decomposing, the amount of communication among subgraphs is reduced, and the communication cost for query processing is lowered. Moreover, utilizing the query order for RDF subgraph matching can effectively reduce the generation of intermediate result sets and accelerate the efficiency of subgraph matching. On this basis, the performances of the proposed algorithm and several other widely used algorithms are compared and analyzed on two different datasets. Experiments show that the proposed algorithm has better advantages in database recreation, memory size, and execution efficiency. </p> <p> </p>

Style APA, Harvard, Vancouver, ISO itp.

7

Schumacher, Heiner. "On Repeated Games with Endogenous Matching Decision". Journal of Institutional and Theoretical Economics 171, nr 3 (2015): 544. http://dx.doi.org/10.1628/093245615x14302136524716.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Bishop, Nicholas, Hau Chan, Debmalya Mandal i Long Tran-Thanh. "Sequential Blocked Matching". Proceedings of the AAAI Conference on Artificial Intelligence 36, nr 5 (28.06.2022): 4834–42. http://dx.doi.org/10.1609/aaai.v36i5.20411.

Pełny tekst źródła

Streszczenie:

We consider a sequential blocked matching (SBM) model where strategic agents repeatedly report ordinal preferences over a set of services to a central planner. The planner's goal is to elicit agents' true preferences and design a policy that matches services to agents in order to maximize the expected social welfare with the added constraint that each matched service can be blocked or unavailable for a number of time periods. Naturally, SBM models the repeated allocation of reusable services to a set of agents where each allocated service becomes unavailable for a fixed duration. We first consider the offline SBM setting, where the strategic agents are aware of their true preferences. We measure the performance of any policy by distortion, the worst-case multiplicative approximation guaranteed by any policy. For the setting with s services, we establish lower bounds of Ω(s) and Ω(√s) on the distortions of any deterministic and randomised mechanisms, respectively. We complement these results by providing approximately truthful, measured by incentive ratio, deterministic and randomised policies based on random serial dictatorship which match our lower bounds. Our results show that there is a significant improvement if one considers the class of randomised policies. Finally, we consider the online SBM setting with bandit feedback where each agent is initially unaware of her true preferences, and the planner must facilitate each agent in the learning of their preferences through the matching of services over time. We design an approximately truthful mechanism based on the explore-then-commit paradigm, which achieves logarithmic dynamic approximate regret.

Style APA, Harvard, Vancouver, ISO itp.

9

Kim, Hee Chun. "Repeated Two-Sided Matching with Multi-Attribute Preference". Korean Journal of Industrial Organization 27, nr 4 (31.12.2019): 87–121. http://dx.doi.org/10.36354/kjio.27.4.3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Xu, Zhenzhen, i John D. Kalbfleisch. "Repeated Randomization and Matching in Multi-Arm Trials". Biometrics 69, nr 4 (17.10.2013): 949–59. http://dx.doi.org/10.1111/biom.12077.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Repeated Matchings"

1

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Valero, Daniel. "Wireless Signal Conditioning". Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc862776/.

Pełny tekst źródła

Streszczenie:

This thesis presents a new approach to extend and reduce the transmission range in wireless systems. Conditioning is defined as purposeful electromagnetic interference that affects a wireless signal as it propagates through the air. This interference can be used constructively to enhance a signal and increase its energy, or destructively to reduce energy. The constraints and limitations of the technology are described as a system model, and a flow chart is used to describe the circuit process. Remaining theoretical in nature, practical circuit implementations are foregone in the interest of elementary simulations depicting the interactions of modulated signals as they experience phase mismatch. Amplitude modulation and frequency modulation are explored with using both positive and negative conditioning, and conclusions to whether one is more suitable than the other are made.

Style APA, Harvard, Vancouver, ISO itp.

4

Oluwaniyi, Emmanuel Dejo. "Effectiveness of Prisoner Reentry Programs for Reduction of Repeat Incarcerations in Nigeria". ScholarWorks, 2017. https://scholarworks.waldenu.edu/dissertations/4317.

Pełny tekst źródła

Streszczenie:

The persistently high rate of repeat incarcerations poses a threat to the safety of lives and properties. The problem that led to this study was the prevailing high rate of repeat incarcerations in Nigeria, despite interventions to reduce their occurrences. The purpose of the study was to evaluate the effectiveness of prisoner reentry programs in reducing reincarcerations of ex-prisoners. The focus of the research questions was on whether treatment and the type (faith- or non-faith-based) made a difference in a prisoner's reincarceration status after release. The theoretical foundation was based on the transtheoretical model of change. Reincarceration outcomes were analyzed for 818 prisoners who were released between January 2010 and December 2013 from 3 prisons located in Lagos State, Nigeria. Data were obtained from the prison records on the reincarceration status of the subjects based on an at-risk period of 36 months after release. A propensity score matching procedure was used to select an equal number (n = 409) of treated subjects (those who participated in a prisoner reentry program) and untreated subjects (nonparticipants in the program). Findings from a Cox-regression analysis revealed that participating in any of the programs (faith- or non-faith-based) reduced reincarceration at a statistically significant level; however, there was no difference in reincarceration status based on the type of treatment received. Findings provide evidence that prisoner reentry programs can reduce reincarceration. With this knowledge, the reentry program providers may advocate more government supports for reentry activities. They may collaborate with the policymakers and legislators to develop strategies that will enhance the reintegration of ex-prisoners into communities and thereby prevent their return to crimes but ensure they are productive for themselves, their families and the community.

Style APA, Harvard, Vancouver, ISO itp.

5

Narang, Shivika. "Algorithms for Achieving Fairness and Efficiency in Matching Problems". Thesis, 2023. https://etd.iisc.ac.in/handle/2005/6140.

Pełny tekst źródła

Streszczenie:

Matching problems arise in numerous practical settings. Fairness and efficiency are two desirable properties in most such real world scenarios. This dissertation work presents new approaches and models for capturing and solving fairness issues in different practical settings and develops algorithms to identify fair and/or efficient matchings. The thesis is organised into two logical parts: one-sided preferences and two-sided preferences. Part 1: One-Sided Preferences Fair and Efficient Delivery Motivated by the classical delivery problem, we introduce a novel model of fair division where delivery tasks must be fairly distributed among a set of agents. The delivery tasks are placed on the vertices of a given acyclic graph. The cost incurred by the agents is determined by the distance they travel from the hub where they start to service their assigned tasks. We study the existence of fair and efficient allocations of tasks to agents. We choose the fairness notions: EF1 and MMS and efficiency notions: Pareto optimality and Social optimality. We find that while all these notions can be satisfied independently, the only combination of fairness and efficiency that can always be guaranteed is MMS and PO. For the remaining combinations, we provide characterisations of the space of instances for which they can be achieved. We find that most of the relevant problems are NP-Hard. We provide an XP-algorithm which finds the different combinations of fairness and efficiency whenever they exist. Repeated Matchings We propose a novel repeated matching model where the valuations of agents may change with how often they have received an item in the past. We study achieving fairness and efficiency separately as well as in conjunctions in this setting. We find that optimizing for social welfare is NP-Hard for general valuations and tractable when the valuations are monotone with time. We also prove that maximizing for social welfare over the space of EF1 repeated matchings is NP-Hard. Further, we provide algorithms and non-existence results for EF1 and EFX repeated matchings in different settings. Part 2: Two Sided Preferences Fairness and Stability in Many-to-One Matchings We seek to optimize a fairness measure over the space of stable many-to-one matchings, motivated by a college admissions setting. With leximin optimality as the fairness notion, we first show the intractability of this problem. We identify a minimal set of assumptions that makes this problem solvable in polynomial time. This requires that the agents on either side have the same ordinal rankings over the agents on the other side and that these must be strict. We show that on relaxing to weak rankings, the problem becomes APX-Hard. When we remove the ranking assumption but maintain strict preferences, the problem is NP-Hard. Additionally, we show that the leximin optimal stable matching can be efficiently computed in the special case of two colleges. Incentive Compatibility in Stable Fractional Matchings We investigate the existence of incentive compatible mechanisms that find stable fractional matchings. We show, for general settings, that no incentive compatible mechanism can be stable. We characterise the space of instances that have a unique stable fractional matching. We prove for this set of instances that any stable matching mechanism will be incentive compatible
Tata Consultancy Services

Style APA, Harvard, Vancouver, ISO itp.

6

Gat, Christopher. "Feature-based matching in historic repeat photography: an evaluation and assessment of feasibility". Thesis, 2011. http://hdl.handle.net/1828/3461.

Pełny tekst źródła

Streszczenie:

This study reports on the quantitative evaluation of a set of state-of-the-art feature detectors and descriptors in the context of repeat photography. Unlike most related work, the proposed study assesses the performance of feature detectors when intra-pair variations are uncontrolled and due to a variety of factors (landscape change, weather conditions, different acquisition sensors). There is no systematic way to model the factors inducing image change. The proposed evaluation is performed in the context of image matching, i.e. in conjunction with a descriptor and matching strategy. Thus, beyond just comparing the performance of these detectors and descriptors, we also examine the feasibility of feature-based matching on repeat photography. Our dataset consists of a set of repeat and historic images pairs that are representative for the database created by the Mountain Legacy Project www.mountainlegacy.ca.
Graduate

Style APA, Harvard, Vancouver, ISO itp.

7

Περδικούρη, Αικατερίνη. "Αλγόριθμοι διαχείρισης και ανάλυσης ακολουθιών βιολογικών δεδομένων με εφαρμογή σε προβλήματα βιοπληροφορικής". Thesis, 2006. http://nemertes.lis.upatras.gr/jspui/handle/10889/1415.

Pełny tekst źródła

Streszczenie:

Αντικείμενο της παρούσας διδακτορικής διατριβής είναι η μελέτη και η σχεδίαση αποδοτικών αλγορίθμων για τη διαχείριση και ανάλυση ακολουθιών βιολογικών δεδομένων. Οι αλγόριθμοι που θα περιγράψουμε εφαρμόζονται σε προβλήματα Βιοπληροφορικής, όπως η αναγνώριση γνωστών ή άγνωστων μοτίβων του DNA και RNA, που εμπλέκονται σε ποικίλες βιολογικές διεργασίες καθώς και η ανακάλυψη περιοδικοτήτων. Ειδικότερα οι αλγόριθμοι που θα παρουσιάσουμε χρησιμοποιούνται για την ανάλυση Βιολογικών Ακολουθιών με “αδιάφορους χαρακτήρες” και Βιολογικών Ακολουθιών με Βάρη. Οι Βιολογικές Ακολουθίες με “αδιάφορους χαρακτήρες” αναπαριστούν συνήθως οικογένειες πρωτεϊνών ενώ οι Βιολογικές Ακολουθίες με βάρη αναπαριστούν συναρμολογούμένες ακολουθίες γονιδιωμάτων που έχουν πρόσφατα αλληλουχηθεί. Στις Βιολογικές Ακολουθίες με αδιάφορους χαρακτήρες παρουσιάζουμε δυο αποδοτικούς αλγορίθμους γραμμικού χρόνου για τον υπολογισμό της περιόδου και τον υπολογισμό του καλύμματος. Ο δεύτερος αλγόριθμος εφαρμόζεται και σε κυκλικά (circular DNAs). Στις Βιολογικές Ακολουθίες με βάρη παρουσιάζουμε δυο αλγορίθμους για τον υπολογισμό των βασικών περιοδικοτήτων: της περιόδου και του καλύμματος ενώ επιλύουμε και το πρόβλημα της εύρεσης προτύπου. Η ανάγκη για αποδοτική διαχείριση βιολογικών ακολουθιών με βάρη μας ώθησε να εισάγουμε μια νέα αποδοτική δομή η οποία επιλύει αποδοτικά τα 2 προηγούμενα προβλήματα. Η δομή αυτή ονομάζεται Δέντρο Επιθεμάτων με Βάρη. Χρησιμοποιώντας το Δέντρο Επιθεμάτων με Βάρη επιλύουμε διάφορες παραλλαγές του προβλήματος εξαγωγής μοτίβων από Βιολογικές Ακολουθίες με Βάρη. Τέλος αποφασίσαμε να μελετήσουμε τη χρήση των Γενετικών Αλγορίθμων και του Εξελικτικού Προγραμματισμού στην ανάλυση ακολουθιών βιολογικών δεδομένων. Αποτέλεσμα αυτής της μελέτης είναι η περιγραφή ενός γενετικού αλγορίθμου που υπολογίζει τις επαναλήψεις σε μια βιολογική ακολουθία.
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.

Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Repeated Matchings"

1

Batzoglou, Serafim, i Sorin Istrail. "Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem". W Combinatorial Pattern Matching, 66–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48452-3_5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Thiemann, Peter. "Avoiding repeated tests in pattern matching". W Static Analysis, 141–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57264-3_36.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Ṣahinalp, S. Cenk, Evan Eichler, Paul Goldberg, Petra Berenbrink, Tom Friedetzky i Funda Ergun. "Statistical Identification of Uniformly Mutated Segments within Repeats". W Combinatorial Pattern Matching, 249–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45452-7_21.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Kolpakov, Roman, Mikhail Podolskiy, Mikhail Posypkin i Nickolay Khrapov. "Searching of Gapped Repeats and Subrepetitions in a Word". W Combinatorial Pattern Matching, 212–21. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07566-2_22.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Swidan, Firas, Michal Ziv-Ukelson i Ron Y. Pinter. "On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem". W Combinatorial Pattern Matching, 141–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11780441_14.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Ponter, Alan R. S. "A Linear Matching Method for Shakedown Analysis". W 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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Turina, Andreas, Tinne Tuytelaars, Theo Moons i Luc Van Gool. "Grouping via the Matching of Repeated Patterns". W Lecture Notes in Computer Science, 252–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44732-6_26.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Stoye, Jens, i Dan Gusfield. "Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version". W Combinatorial Pattern Matching, 140–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0030787.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Arratia, Richard, i Gesine Reinert. "Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization". W Combinatorial Pattern Matching, 209–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61258-0_16.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Sagot, Marie-France, i Alain Viari. "Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices". W Combinatorial Pattern Matching, 224–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63220-4_62.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Repeated Matchings"

1

Sühr, Tom, Asia J. Biega, Meike Zehlike, Krishna P. Gummadi i Abhijnan Chakraborty. "Two-Sided Fairness for Repeated Matchings in Two-Sided Markets". W 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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Indow, Tarow. "Discrimination Ellipsoid of Surface Color". W Advances in Color Vision. Washington, D.C.: Optica Publishing Group, 1992. http://dx.doi.org/10.1364/acv.1992.sac5.

Pełny tekst źródła

Streszczenie:

Discrimination thresholds in various directions from a standard color stimulus s0 are represented by an ellipsoid in the (x, y, Y) space or, when the luminance Y is kept constant, by an ellipse on the chromaticity diagram. It has been a tradition since MacAdam (1942) to define thresholds by fluctuation of repeated color matchings under the assumption that the distribution of colors indiscriminable from s0 is 3-D or 2-D normal fN(s). This procedure cannot be applied to painted color samples and the discrimination ellipsoid around s0 is defined through paired comparisons of s0 and sj, where sj's are a set of prepared samples, j = 1, 2,…, n. As to method of obtaining an ellipsoid from these data, the situation is chaotic. Indow and Morrison (1991) proposed a procedure that is an extension of the method of constant stimuli for uni-dimensional stimulus continuum. Denote by Pj the rate that sj is judged different from s0 where sj differs from s0 in various directions Λ = 1, 2,…, n.

Style APA, Harvard, Vancouver, ISO itp.

3

Budinich, Michele, i Lance Fortnow. "Repeated matching pennies with limited randomness". W the 12th ACM conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1993574.1993592.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Le Brese, Christopher, Ju Jia Zou i Brian Uy. "An improved ASIFT algorithm for matching repeated patterns". W 2010 17th IEEE International Conference on Image Processing (ICIP 2010). IEEE, 2010. http://dx.doi.org/10.1109/icip.2010.5653485.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Yang, Hongtai, Xiang Li, Xiaotian Qin, Yanfen Jiang i Fangfang Zheng. "User Matching Algorithm Based on Repeated Transfer Behavior". W 2021 6th International Conference on Transportation Information and Safety (ICTIS). IEEE, 2021. http://dx.doi.org/10.1109/ictis54573.2021.9798668.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Olzak, Lynn A., i James P. Thomas. "Spatial frequency matching in complex stimuli". W OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1986. http://dx.doi.org/10.1364/oam.1986.thn2.

Pełny tekst źródła

Streszczenie:

Spatial frequency discrimination can be either facilitated or reduced by the addition of a grating mask to each test component, depending on the separation between mask and test frequencies. At small separations, performance is facilitated, probably due to unique beat patterns. At larger separations, performance is reduced. Reductions in performance might be explained if the mask introduces noise into the system; alternatively, the mask may alter the apparent spatial frequency of the test gratings, reducing the apparent difference between them. These possibilities were explored in a two-interval spatial frequency matching task. In the first interval, the test stimulus was repeatedly presented. A given test stimulus was composed of a vertical sinusoidal grating, either alone or masked by another frequency component. In the second interval, a sinusoidal grating of variable spatial frequency appeared. For each block of trials, the observer chose one component of the test stimulus to match. Blocks were repeated until the observer was satisfied that all distinct components had been matched for a given test stimulus. Matches were determined by averaging matches obtained by two randomly interleaved, independent staircases. The results provide information about the cues used in the complex discrimination task and are interpreted in relation to the discrimination data by means of a simple model.

Style APA, Harvard, Vancouver, ISO itp.

7

ZHANG, Yan, Yutao ZHAO i Guangxu LI. "Robot Arm Repeated Positioning Accuracy Measurement Using Nonlinear Local Feature Matching". W 2018 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC). IEEE, 2018. http://dx.doi.org/10.1109/icspcc.2018.8567779.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Schindler, Grant, Panchapagesan Krishnamurthy, Roberto Lublinerman, Yanxi Liu i Frank Dellaert. "Detecting and matching repeated patterns for automatic geo-tagging in urban environments". W 2008 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2008. http://dx.doi.org/10.1109/cvpr.2008.4587461.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Duan, XiaoRong, chenni dong i xin ma. "Research and implementation of network defense and non-repeated substring pattern matching algorithm". W International Conference on Signal Processing and Communication Security (ICSPCS 2022), redaktorzy Min Xiao i Lisu Yu. SPIE, 2022. http://dx.doi.org/10.1117/12.2655409.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Wu, Gang, i Chris Chu. "Simultaneous Slack Matching, Gate Sizing and Repeater Insertion for Asynchronous Circuits". W 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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!