Littérature scientifique sur le sujet « Weighted strings »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Weighted strings ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Weighted strings"
ZHANG, MENG, LIANG HU et YI ZHANG. « WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING ». International Journal of Foundations of Computer Science 22, no 04 (juin 2011) : 921–43. http://dx.doi.org/10.1142/s0129054111008490.
Texte intégralMOHRI, MEHRYAR. « EDIT-DISTANCE OF WEIGHTED AUTOMATA : GENERAL DEFINITIONS AND ALGORITHMS ». International Journal of Foundations of Computer Science 14, no 06 (décembre 2003) : 957–82. http://dx.doi.org/10.1142/s0129054103002114.
Texte intégralBROUTIN, N., et L. DEVROYE. « An Analysis of the Height of Tries with Random Weights on the Edges ». Combinatorics, Probability and Computing 17, no 2 (mars 2008) : 161–202. http://dx.doi.org/10.1017/s0963548307008796.
Texte intégralHyyrö, Heikki, et Shunsuke Inenaga. « Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions ». International Journal of Foundations of Computer Science 29, no 04 (juin 2018) : 623–45. http://dx.doi.org/10.1142/s0129054118410083.
Texte intégralLouchard, Guy, et Wojciech Szpankowski. « A Probabilistic Analysis of a String Editing Problem and its Variations ». Combinatorics, Probability and Computing 4, no 2 (juin 1995) : 143–66. http://dx.doi.org/10.1017/s0963548300001541.
Texte intégralBarton, Carl, Chang Liu et Solon P. Pissis. « Fast Average-Case Pattern Matching on Weighted Sequences ». International Journal of Foundations of Computer Science 29, no 08 (décembre 2018) : 1331–43. http://dx.doi.org/10.1142/s0129054118430062.
Texte intégralBarton, Carl, et Solon P. Pissis. « Crochemore’s Partitioning on Weighted Strings and Applications ». Algorithmica 80, no 2 (27 janvier 2017) : 496–514. http://dx.doi.org/10.1007/s00453-016-0266-0.
Texte intégralSADRI, JAVAD, CHING Y. SUEN et TIEN D. BUI. « STATISTICAL CHARACTERISTICS OF SLANT ANGLES IN HANDWRITTEN NUMERAL STRINGS AND EFFECTS OF SLANT CORRECTION ON SEGMENTATION ». International Journal of Pattern Recognition and Artificial Intelligence 24, no 01 (février 2010) : 97–116. http://dx.doi.org/10.1142/s0218001410007816.
Texte intégralAlshawi, Hiyan, Srinivas Bangalore et Shona Douglas. « Learning Dependency Translation Models as Collections of Finite-State Head Transducers ». Computational Linguistics 26, no 1 (mars 2000) : 45–60. http://dx.doi.org/10.1162/089120100561629.
Texte intégralCieliebak, Mark, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye et Emo Welzl. « Algorithmic complexity of protein identification : combinatorics of weighted strings ». Discrete Applied Mathematics 137, no 1 (février 2004) : 27–46. http://dx.doi.org/10.1016/s0166-218x(03)00187-2.
Texte intégralThèses sur le sujet "Weighted strings"
Wacher, Abigail. « String gradient weighted moving finite elements for systems of partial differential equations ». Thesis, University of Oxford, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.404276.
Texte intégralJansche, Martin. « Inference of string mappings for speech technology ». Columbus, Ohio : Ohio State University, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1061209163.
Texte intégralTitle from first page of PDF file. Document formatted into pages; contains xv, 268 p.; also includes graphics. Includes abstract and vita. Advisor: Chris Brew, Dept. of Linguistics. Includes bibliographical references (p. 252-266) and index.
Θεοδωρίδης, Ευάγγελος. « Αποδοτική διαχείριση κειμενικής πληροφορίας, δεικτοδότηση, αποθήκευση, επεξεργασία και εφαρμογές ». Thesis, 2009. http://nemertes.lis.upatras.gr/jspui/handle/10889/1656.
Texte intégralThe basic goal of this thesis is to explore the possibilities of the field of computer science that deals with storing and processing information in the environment that formed by the modern applications. In recent years, the information that is available in electronic form, has met an enormous growth. Thus it is necessary to develop new techniques for efficient storage and processing. Two very specific and important applications in which constantly new problems arise are, the management of biological data, such as genome sequences, and the management information from the Web, such as documents HTML, XML or shortcuts (urls). The objective is the development of data structures for indexing information so that the questions are able to be answered in less time than looking explicitly in information. Such questions are to find patterns (pattern matching) or the identification of repeated motifs (motif extraction). In particular, the issues on which this thesis has focused are: - Locating Periodicities in strings. This section provides a series of algorithms for the extraction of periodicities of strings. We propose algorithms for the extraction of maximum repetitions of the cover, period and the seed of a string. The algorithms used are based on suffix tree and they are optimal. - Weighted Sequences indexing. In the next section, the study focuses on indexing of weighted sequences, and to answer questions like finding models, pairs, covers etc. in them. The weighted sequences are sequences where each position consists of all the symbols of the alphabet in sequence, having each one a specific weight. For the management of these sequences a particular indexing structure is proposed with the name Weighted Suffix Tree, a tree with structural features similar to those of the generalized suffix tree. In this work we propose the definition of the weighted suffix tree and construction algorithms in linear time and memory space. With the utilization of weighted suffix tree on a set of weighted sequences we propose algorithms for extracting repetitive structures from a set of weighted sequences. More specifically, we propose algorithms for finding maximum pairs, repeated motifs and common patterns of more than one weighted sequences -Recommendation Algorithms for web pages using strings processing algorithms. Several web applications (Recommendation systems or cache systems) want to predict the intentions of a visitor in order to propose or to preload a webpage. For this purpose systems try to exploit any experience that is recorded in the system from previous accesses. A new method for indexing and representing of information extracted is proposed upon the recorder data, from the user accesses in log files and content pages. For extracting knowledge from these data, the information is represented as strings and then treated and processed as weighted sequences. All these sequences are indexed by a generalized weighted sequence tree.
Παναγής, Ιωάννης-Δαμαστιανός. « Δομές δεδομένων για τη διαχείριση συμβολοσειρών και για τη διαχείριση πληροφορίας σε δικτυοκεντρικά πληροφοριακά συστήματα ». Thesis, 2006. http://nemertes.lis.upatras.gr/jspui/handle/10889/1426.
Texte intégralData Structures is one of the most important and most historical sectors of Computer Science, being under continuous development since the seventies. Data Structuring has offered solutions to fundamental problems in sorting, organising, and retrieving information. Meanwhile, the development of the modern fields of Computer Science such as Modern, Net-centric Information Systems and Bioinformatics has signalled a data blow-up. Therefore, the need for efficient information management has become a necessity. In this Thesis, having recognized the need for efficient information management at every level, we present a study and solutions to contemporary problems in the areas of: String Processing, Website Reorganization, Web Service retrieval with support for Quality of Service characteristics, and Personalized Information Retrieval on the Web. In the area of String Processing, we present algorithms for solving fundamental problems in Weighted Sequence Processing, such as Pattern Matching, Repetitive Structures Detection and we continue by giving simplifying yet optimal solutions to periodicity problems in ordinary sequences, namely detecting all covers in a sequence, detecting the period of a sequence and detecting all the seeds of a sequence. In the area of Website Reorganization, we present two different metrics for evaluation of the objective importance of each website's pages. These metrics modify the accesses each page receives in order to present the actual page importance. We have seen from the experimental evaluation of those metrics that they provide accurate information about the areas inside the website in need of reorganization. Furthermore, we present a method to detect larger important parts inside the website and we present methods for website reorganisation both from a technical and from a theoretical viewpoint. In the area of Web Service Retrieval we are coping with retrieval under constraints for the provided Quality of Service (QoS). Firstly, we present two simple methods to register QoS information by extending existing Web Service protocols. Secondly, we present an algorithm to discover the execution scenario for a sequence of contiguous Web Services that minimizes the total execution time. A series of heuristics to implement the above algorithm is also presented. We also present an extensive experimental evaluation of those heuristics. Ultimately, we present different personalization techniques for personalized Web Information Retrieval. The first technique, applies post-categorization of search engine results and presents them according to user preferences with respect to the results' categories. The second technique is based on implicit mapping of user preferences to the categories of the Open Directory Project, it extends a recently proposed technique, namely virtual nodes for associating categories, and builds multiple layers of nodes to achieve more elaborate personalization. Finally, we present the extension of personalization methods in order to build focused crawlers.
Livres sur le sujet "Weighted strings"
Little, Jean. Garfield gains weight. New York : Ballantine Books, 2001.
Trouver le texte intégraltranslator, Scott-Railton Thomas, dir. Blast : Dead weight. Paris?] : Europe Comics, 2015.
Trouver le texte intégralThorpe, J. Analysis of bird strikes to UK registered aircraft 1984 : (civil aircraft over 5700kg maximum weight). London : Civil Aviation Authority, 1986.
Trouver le texte intégralGarfield pulls his weight. Taiwan : Shuang Dua, 1998.
Trouver le texte intégralGarfield pulls his weight. New York : Ballantine Books, 1994.
Trouver le texte intégralThorpe, J. Analysis of bird strikes to United Kingdom registered aircraft 1985 : Civil aircraft over 5700kg maximum weight. London : Civil Aviation Authority, 1987.
Trouver le texte intégralNeonpi. Taiŏt'ŏ : Kŏn'gang han saenghwal ŭl wihan pon'gyŏk taiŏt'ŭ wept'un. Sŏul-si : Chungang Books, 2011.
Trouver le texte intégralCarlos, Pacheco, et Merino Jesús, dir. Superman. : The weight of the world. New York : DC Comics, 2008.
Trouver le texte intégralBusiek, Kurt. Superman. : The weight of the world. New York : DC Comics, 2008.
Trouver le texte intégralGaines, Charles. Staying hard : The only exercise book you will ever need. New York : Simon & Schuster, 1985.
Trouver le texte intégralChapitres de livres sur le sujet "Weighted strings"
Rabusseau, Guillaume. « Minimization of Graph Weighted Models over Circular Strings ». Dans Lecture Notes in Computer Science, 513–29. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89366-2_28.
Texte intégralBansal, Nikhil, Mark Cieliebak et Zsuzsanna Lipták. « Efficient Algorithms for Finding Submasses in Weighted Strings ». Dans Combinatorial Pattern Matching, 194–204. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27801-6_14.
Texte intégralCieliebak, Mark, Zsuzsanna Lipták, Emo Welzl, Thomas Erlebach et Jens Stoye. « Algorithmic Complexity of Protein Identification : Searching in Weighted Strings ». Dans Foundations of Information Technology in the Era of Network and Mobile Computing, 143–56. Boston, MA : Springer US, 2002. http://dx.doi.org/10.1007/978-0-387-35608-2_13.
Texte intégralBarton, Carl, et Solon P. Pissis. « Linear-Time Computation of Prefix Table for Weighted Strings ». Dans Lecture Notes in Computer Science, 73–84. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23660-5_7.
Texte intégralDe Stefano, Claudio, Marco Garruto, Luis Lapresa et Angelo Marcelli. « Using Strings for On-Line Handwriting Shape Matching : A New Weighted Edit Distance ». Dans Image Analysis and Processing – ICIAP 2005, 1125–32. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11553595_138.
Texte intégralFranek, Lucas, et Xiaoyi Jiang. « Evolutionary Weighted Mean Based Framework for Generalized Median Computation with Application to Strings ». Dans Lecture Notes in Computer Science, 70–78. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34166-3_8.
Texte intégralWelsing, Alexander, Andreas Nienkötter et Xiaoyi Jiang. « Exponential Weighted Moving Average of Time Series in Arbitrary Spaces with Application to Strings ». Dans Lecture Notes in Computer Science, 45–54. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-73973-7_5.
Texte intégralAmir, Amihood, Zvi Gotthilf et B. Riva Shalom. « Weighted Shortest Common Supersequence ». Dans String Processing and Information Retrieval, 44–54. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24583-1_6.
Texte intégralIliopoulos, Costas S., Katerina Perdikuri, Evangelos Theodoridis, Athanasios Tsakalidis et Kostas Tsichlas. « Motif Extraction from Weighted Sequences ». Dans String Processing and Information Retrieval, 286–97. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30213-1_41.
Texte intégralJiang, Xiaoyi, et Horst Bunke. « Weighed Mean Generalized Median of Strings ». Dans Pattern Recognition and String Matching, 295–314. Boston, MA : Springer US, 2003. http://dx.doi.org/10.1007/978-1-4613-0231-5_12.
Texte intégralActes de conférences sur le sujet "Weighted strings"
Hajianmaleki, Mehdi, Jeremy S. Daily, Lev Ring et Raju Gandikota. « Buckling Analysis of Drill Strings in Inclined Wellbores Using the Explicit Finite Element Method ». Dans ASME 2012 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/imece2012-89638.
Texte intégralKishino, Mika, et Kanako Komiya. « Extraction of Linguistic Speech Patterns of Japanese Fictional Characters using Subword Units ». Dans 10th International Conference on Natural Language Processing (NLP 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.112307.
Texte intégralAmat, Sergio, Gustavo E. Henríquez Velez et María J. Legaz. « Drilling String Vibration : Modelling and Simulation ». Dans ASME 2018 37th International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/omae2018-77685.
Texte intégralDalgit Singh, Harpreet Kaur, Essam Sammat, Thakornpol Kleawyothatis, Kittikun Niracharopas et Kazem Kiani Nassab. « Gulf of Thailand 4-String Well Design Transformation Using MPD System – Cost Saving, Operational Challenges and Learnings ». Dans IADC/SPE Asia Pacific Drilling Technology Conference and Exhibition. SPE, 2022. http://dx.doi.org/10.2118/209911-ms.
Texte intégralMalocha, Svetlana, Rodolfo Chang et Jon Vandendriessche. « String weighted tapered SAW transducer analysis ». Dans 2009 IEEE International Ultrasonics Symposium. IEEE, 2009. http://dx.doi.org/10.1109/ultsym.2009.5441791.
Texte intégralBarenghi, Alessandro, et Gerardo Pelosi. « Constant weight strings in constant time ». Dans CF '20 : Computing Frontiers Conference. New York, NY, USA : ACM, 2020. http://dx.doi.org/10.1145/3387902.3392630.
Texte intégralReinås, Lorents, Morten Sæther et Bernt Sigve Aadnøy. « The Effect of a Fatigue Failure on the Wellhead Ultimate Load Capacity ». Dans ASME 2012 31st International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/omae2012-83325.
Texte intégralOkul, Aydin, et Ercan Gurses. « Development of Structural Neural Network Design Tool for Buckling Behaviour of Skin-Stringer Structures Under Combined Compression and Shear Loading ». Dans ASME 2018 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/imece2018-87970.
Texte intégralSherman, Elena, et Andrew Harris. « Accurate String Constraints Solution Counting with Weighted Automata ». Dans 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE). IEEE, 2019. http://dx.doi.org/10.1109/ase.2019.00049.
Texte intégralRama, Taraka. « Automatic cognate identification with gap-weighted string subsequences. » Dans Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics : Human Language Technologies. Stroudsburg, PA, USA : Association for Computational Linguistics, 2015. http://dx.doi.org/10.3115/v1/n15-1130.
Texte intégralRapports d'organisations sur le sujet "Weighted strings"
Bonfil, David J., Daniel S. Long et Yafit Cohen. Remote Sensing of Crop Physiological Parameters for Improved Nitrogen Management in Semi-Arid Wheat Production Systems. United States Department of Agriculture, janvier 2008. http://dx.doi.org/10.32747/2008.7696531.bard.
Texte intégral