Partially persistent search trees with transcript operations.
Displaying 41 – 60 of 222
Partially-additive monoids
Antonio Bahamonde (1985)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Parties reconnaissables de monoïdes définis par générateurs et relations
Jacqueline Lacaze (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Partitioned iterated function systems with division and a fractal dependence graph in recognition of 2D shapes
Krzysztof Gdawiec, Diana Domańska (2011)
International Journal of Applied Mathematics and Computer Science
One of the approaches in pattern recognition is the use of fractal geometry. The property of self-similarity of fractals has been used as a feature in several pattern recognition methods. All fractal recognition methods use global analysis of the shape. In this paper we present some drawbacks of these methods and propose fractal local analysis using partitioned iterated function systems with division. Moreover, we introduce a new fractal recognition method based on a dependence graph obtained from...
Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.
P.K. Agarwal (1990)
Discrete & computational geometry
Partitioning Arrangements of Lines, II: Applications.
P.K. Agarwal (1990)
Discrete & computational geometry
Pascal's triangle, complexity and automata. (Triangle de Pascal, complexité et automates.)
Allouche, Jean-Paul, Berthé, Valérie (1997)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Paths through fixed vertices in edge-colored graphs
W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza (1994)
Mathématiques et Sciences Humaines
We study the problem of finding an alternating path having given endpoints and passing through a given set of vertices in edge-colored graphs (a path is alternating if any two consecutive edges are in different colors). In particular, we show that this problem in NP-complete for 2-edge-colored graphs. Then we give a polynomial characterization when we restrict ourselves to 2-edge-colored complete graphs. We also investigate on (s,t)-paths through fixed vertices, i.e. paths of length s+t such that...
Pattern avoidance in partial words over a ternary alphabet
Adam Gągol (2015)
Annales UMCS, Mathematica
Blanched-Sadri and Woodhouse in 2013 have proven the conjecture of Cassaigne, stating that any pattern with m distinct variables and of length at least 2m is avoidable over a ternary alphabet and if the length is at least 3 2m−1 it is avoidable over a binary alphabet. They conjectured that similar theorems are true for partial words - sequences, in which some characters are left “blank”. Using method of entropy compression, we obtain the partial words version of the theorem for ternary words
Pattern occurrence in the dyadic expansion of square root of two and an analysis of pseudorandom number generators.
Nuida, Koji (2010)
Integers
Pattern recognition using chaotic neural networks.
Tan, Z., Hepburn, B.S., Tucker, C., Ali, M.K. (1998)
Discrete Dynamics in Nature and Society
PC-PARIS - An Interactive Software System for Statistical Pattern Recognition
Milan M. Milosavljević, Milan Ž. Marković (1999)
The Yugoslav Journal of Operations Research
PCP-prime words and primality types
Alexandru Mateescu, Arto Salomaa (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PDF Enhancements Tools for a Digital Library
Hatlapatka, Radim, Sojka, Petr (2010)
Towards a Digital Mathematics Library. Paris, France, July 7-8th, 2010
This paper describes several innovative PDF document enhancements and tools that can be used when building a digital library. The main result presented in this paper is the PDF re-compression tool, developed using the jbig2enc encoder called pdfJbIm. This re-compression tool enables the size of the original bitonal PDFs to be, on average, downsized by one third. Some modifications to the jbig2enc encoder that increase the compression ratio even further are also described here. Together with another...
Peak ground acceleration prediction by artificial neural networks for Northwestern Turkey.
Günaydın, Kemal, Günaydın, Ayten (2008)
Mathematical Problems in Engineering
Pebbling dynamic graphs in minimal space
Peter Ružička, Juraj Waczulík (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Perfect simulation from the quicksort limit distribution.
Devroye, Luc, Fill, James Allen, Neininger, Ralph (2000)
Electronic Communications in Probability [electronic only]
Performance analysis of ATM multiplexer with Bernoulli traffic sources.
Chang, Shu-Yin (2002)
Mathematical Problems in Engineering
Performance analysis of demodulation with diversity -- A combinatorial approach I: Symmetric function theoretical methods.
Dornstetter, J.L., Krob, D., Thibon, J.Y., Vassilieva, E.A. (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Performance considerations on a random graph model for parallel processing
F. Afrati, A. Stafylopatis (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications