Filters








103,042 Hits in 6.6 sec

Faster fully compressed pattern matching by recompression [article]

Artur Jeż
2013 arXiv   pre-print
This technique yields an O((n+m)log M) algorithm for compressed pattern matching, assuming that M fits in O(1) machine words, where n (m) is the size of the compressed representation of the text (pattern  ...  In this paper, a fully compressed pattern matching problem is studied.  ...  Acknowledgements I would like to thank Paweł Gawrychowski for introducing me to the topic, for pointing out the relevant literature [13, 15, 16] and discussions [2] .  ... 
arXiv:1111.3244v4 fatcat:ekh5wdcx6zhtrcehih7a4poejq

Faster and simpler algorithms for finding large patterns in permutations [article]

László Kozma
2019 arXiv   pre-print
For the special case of patterns that are Jordan-permutations, we show an improved, subexponential running time.  ...  Our approach can be summarized as follows: "for every matching of the even-valued entries of the pattern, try to match all odd-valued entries left-to-right".  ...  I thank Günter Rote for pointing out the error. This work was prompted by the Dagstuhl Seminar 18451 "Genomics, Pattern Avoidance, and Statistical Mechanics".  ... 
arXiv:1902.08809v2 fatcat:tb2kb2zh6zfavkjq4ez74jtjem

Using Patterns for Faster and Scalable Rewriting of Conjunctive Queries

Ali Kiani, Nematollaah Shiri
2009 Alberto Mendelzon Workshop on Foundations of Data Management  
In the rewriting phase, based on the available identifiers and partitions of the set {1, ..., 2 n−1 }, we define patterns and use them to encode the buckets and the coverages they contain.  ...  Our numerous experiments using different query types and sizes indicate significant time and space improvement for computing the cartesian products of the buckets and generating the output.  ...  Pottinger for providing us the query generator program, which we extended and used in our work.  ... 
dblp:conf/amw/KianiS09 fatcat:aieox3fudzauhfdf2awqclmdra

Faster exact Markovian probability functions for motif occurrences: a DFA-only approach [article]

Paolo Ribeca, Emanuele Raineri
2008 arXiv   pre-print
The computation of the statistical properties of motif occurrences has an obviously relevant practical application: for example, patterns that are significantly over- or under-represented in the genome  ...  Conclusions: DFAs are a standard tool of computer science for the study of patterns, but so far they have been sparingly used in the study of biological motifs.  ...  .; E.R. and P.R. jointly tested the code, ran the examples and wrote the paper.  ... 
arXiv:0801.3675v1 fatcat:lrvhxc6yabb5zop6voep3f3u2q

Faster Fully Compressed Pattern Matching by Recompression

Artur Jeż
2015 ACM Transactions on Algorithms  
Jeż matching, equality testing, etc.) are known for various practically used compression methods (LZ77, LZW, their variants, etc.)  ...  This technique yields an O((n + m) log M) algorithm for compressed pattern matching, assuming that M fits in O(1) machine words, where n (m) is the size of the compressed representation of the text (pattern  ...  ACKNOWLEDGMENTS I would like to thank Paweł Gawrychowski for introducing me to the topic, for pointing out the relevant literature [Alstrup et al. 2000; Lifshits 2007; Lohrey and Mathissen 2011; Mehlhorn  ... 
doi:10.1145/2631920 fatcat:pcdrs47ghzbdvn5eia4pb7eqdi

Faster Fully Compressed Pattern Matching by Recompression [chapter]

Artur Jeż
2012 Lecture Notes in Computer Science  
Jeż matching, equality testing, etc.) are known for various practically used compression methods (LZ77, LZW, their variants, etc.)  ...  This technique yields an O((n + m) log M) algorithm for compressed pattern matching, assuming that M fits in O(1) machine words, where n (m) is the size of the compressed representation of the text (pattern  ...  ACKNOWLEDGMENTS I would like to thank Paweł Gawrychowski for introducing me to the topic, for pointing out the relevant literature [Alstrup et al. 2000; Lifshits 2007; Lohrey and Mathissen 2011; Mehlhorn  ... 
doi:10.1007/978-3-642-31594-7_45 fatcat:oir4hdzhd5bsjbjohifq276hle

Faster Approximate Pattern Matching: A Unified Approach [article]

Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2020 arXiv   pre-print
Our proofs are constructive and let us obtain a unified framework for approximate pattern matching for both considered distances.  ...  Approximate pattern matching is a natural and well-studied problem on strings: Given a text T, a pattern P, and a threshold k, find (the starting positions of) all substrings of T that are at distance  ...  Finally, the intersection step in Line 13 of Algorithm 18 guarantees that we account for each k-error occurrence exactly once.  ... 
arXiv:2004.08350v2 fatcat:zfgicxdvgjadribq3ep4knuqhu

When higher carrying capacities lead to faster propagation [article]

Marjorie Haond, Thibaut Morel-Journel, Eric Lombaert, Elodie Vercken, Ludovic Mailleret, Lionel Roques
2018 bioRxiv   pre-print
We tested the generality of this statement with reaction-diffusion equations, stochastic individual-based models, and microcosms experiments with Trichogramma chilonis wasps.  ...  Finding general patterns in the expansion of natural populations is a major challenge in ecology and invasion biology.  ...  Based on the results of our study, we argue that positive density-dependent dispersal also leads to pushed propagation patterns.  ... 
doi:10.1101/307322 fatcat:dqiaqp6kwzed3iofgxevqlhpvq

When higher carrying capacities lead to faster propagation

Marjorie Haond, Thibaut Morel-Journel, Eric Lombaert, Elodie Vercken, Ludovic Mailleret, Lionel Roques
2021 Peer Community Journal  
We tested the generality of this statement with reaction-diffusion equations, stochastic individual-based models, and microcosms experiments with Trichogramma chilonis wasps.  ...  Finding general patterns in the expansion of natural populations is a major challenge in ecology and invasion biology.  ...  Based on the results of our study, we argue that positive density-dependent dispersal also leads to pushed propagation patterns.  ... 
doi:10.24072/pcjournal.66 fatcat:rql5czx5pbgpbny4z4if65i7oi

Breast Mass Detection with Faster R-CNN: On the Feasibility of Learning from Noisy Annotations

Sina Famouri, Lia Morra, Leonardo Mangia, Fabrizio Lamberti
2021 IEEE Access  
We provide here a quantitative evaluation of the effect of bounding box coordinate noise on the performance of Faster R-CNN object detection networks for breast mass detection.  ...  Annotating large medical datasets for training data-hungry deep learning models is expensive and time consuming.  ...  ACKNOWLEDGMENTS We gratefully acknowledge the support of NVIDIA Corporation with the donation of the Titan Xp GPU used for this research.  ... 
doi:10.1109/access.2021.3072997 fatcat:7z5ddmcot5a57aqwrqp4ppof5i

Faster Pattern Matching under Edit Distance [article]

Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2022 arXiv   pre-print
In the case where n^1/4+ε≤ k ≤ n^2/5-ε for some arbitrarily small positive constant ε, our algorithm improves over the state-of-the-art by polynomial factors: it is polynomially faster than both the algorithm  ...  We consider the approximate pattern matching problem under the edit distance.  ...  A Faster Algorithm for NewPeriodicMatches In this section, we present the core of our improvements: a faster algorithm for NewPeriodicMatches.  ... 
arXiv:2204.03087v1 fatcat:wgqepmoesna7fbhlchkp6m6tna

Faster Approximate Pattern Matching: A Unified Approach

Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2020 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)  
by Galil and Giancarlo [20]: Based on so-called "kangaroo jumping", they obtained an O(nk)-time algorithm, which is faster than O(n √ m log m) even for moderately large k.  ...  For pattern matching with edits, this means that there is no hope for an algorithm that is significantly faster than O(n + k 2 n/m); however, apart from that "trivial" lower bound Grammar Compression One  ...  Finally, the intersection step in Line 13 of Algorithm 18 guarantees that we account for each k-error occurrence exactly once.  ... 
doi:10.1109/focs46700.2020.00095 fatcat:sm62sj3eizhybdegrr3gjz2o6a

Arabic Sign Language Recognition using Faster R-CNN

Rahaf Abdulaziz Alawwad, Ouiem Bchir, Mohamed Maher
2021 International Journal of Advanced Computer Science and Applications  
For the implementation and the assessment of the proposed Faster R-CNN based sign recognition system, we exploited VGG-16 and ResNet-18 models, and we collected a real ArSL image dataset.  ...  Keywords-Arabic sign language recognition; supervised learning; deep learning; faster region based convolutional neural network  ...  Finally, 3060 images (20%) were reserved for testing. The resulting subsets were used to train both the VGG-16 and ResNet based networks.  ... 
doi:10.14569/ijacsa.2021.0120380 fatcat:edvluovosjgaloo7siygkdwcky

Causal events enter awareness faster than non-causal events

Pieter Moors, Johan Wagemans, Lee de-Wit
2017 PeerJ  
Here we employ Continuous Flash Suppression (CFS)—an interocular suppression technique to render stimuli invisible (Tsuchiya & Koch, 2005)—to test whether causal events enter awareness faster than non-causal  ...  This work therefore supports Michotte's contention that, like colour or motion, causality is an immediate property of our perception of the world.  ...  ACKNOWLEDGEMENTS We would like to thank San Verhavert for assistance in data collection.  ... 
doi:10.7717/peerj.2932 pmid:28149698 pmcid:PMC5274517 fatcat:rup2hokawzbftldjeymuark3zi

Printing floating-point numbers: a faster, always correct method

Marc Andrysco, Ranjit Jhala, Sorin Lerner
2016 SIGPLAN notices  
Acknowledgements We thank the anonymous reviewers for this paper and for a previous version, for their invaluable feedback and suggestions, in particular, for providing a reference to David Matula's In-and-out  ...  Based on these properties, we designed the second iteration of our algorithm Errol2 which behaves as follows.  ...  Recall that by construction, an HP value consists of a base component that best approximates the target value (as an FP) and a smaller offset component that accounts for the remainder (as a non-overlapping  ... 
doi:10.1145/2914770.2837654 fatcat:t2znhuffzjd5bccbakszzeyo5q
« Previous Showing results 1 — 15 out of 103,042 results