Filters








13,453 Hits in 3.1 sec

Fast Cartesian Tree Matching [article]

Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park
2019 arXiv   pre-print
Cartesian tree matching is the problem of finding all substrings of a given text which have the same Cartesian trees as that of a given pattern.  ...  Any exact string matching algorithm can be used as a filtration for Cartesian tree matching on our framework. We also present a SIMD solution for Cartesian tree matching suitable for short patterns.  ...  Fast linear Cartesian tree matching The previous algorithm for Cartesian tree matching due to Park et al. [21] is based on the KMP algorithm [19] .  ... 
arXiv:1908.04937v1 fatcat:gpc5hxq5ufeejl6zc37eysd7ya

Fast Multiple Pattern Cartesian Tree Matching [article]

Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park
2019 arXiv   pre-print
Cartesian tree matching is the problem of finding all substrings in a given text which have the same Cartesian trees as that of a given pattern.  ...  By combining an efficient fingerprinting method and a conventional multiple string matching algorithm, we can efficiently solve multiple pattern Cartesian tree matching.  ...  [19] proposed new representations about Cartesian trees, and proposed practically fast algorithms for Cartesian tree matching based on the framework of filtering and verification.  ... 
arXiv:1911.01644v1 fatcat:rmygw6wbbfcljfy4qroszcq5va

A Compressed Enhanced Suffix Array Supporting Fast String Matching [chapter]

Enno Ohlebusch, Simon Gog
2009 Lecture Notes in Computer Science  
In this paper, we show that the Super-Cartesian tree of the LCP-array (with which the suffix array is enhanced) very naturally explains the child table.  ...  Index structures like the suffix tree or the suffix array are of utmost importance in stringology, most notably in exact string matching.  ...  Each node k, 1 ≤ k ≤ n, in the Super-Cartesian tree is represented by the k-th opening parenthesis (and the matching closing parenthesis). Node n + 1 is not represented.  ... 
doi:10.1007/978-3-642-03784-9_6 fatcat:d2hby3ziqbeshg2gix3nqgdjd4

A Geodetic Normal Distribution Map for Long-term LiDAR Localization on Earth

Chansoo Kim, Sungjin Cho, Myoungho Sunwoo, Paulo Resende, Benazouz Bradai, Kichun Jo
2020 IEEE Access  
The GND map structure supports a geodetic quad-tree tiling system with multiple origins to minimize the coordinate conversion errors.  ...  In order to match the LiDAR measurements with the GND map structure, the paper proposes map-matching approaches based on Monte-Carlo and optimization.  ...  Based on the geodetic-quad-tree tiling, the map around the ego-vehicle can be searched fast.  ... 
doi:10.1109/access.2020.3047421 fatcat:snyk5huksfe6dc62yhgwgsasa4

Evaluation of entity resolution approaches on real-world match problems

Hanna Köpcke, Andreas Thor, Erhard Rahm
2010 Proceedings of the VLDB Endowment  
We therefore present such an evaluation of existing implementations on challenging real-world match tasks.  ...  Despite the huge amount of recent research efforts on entity resolution (matching) there has not yet been a comparative evaluation on the relative effectiveness and efficiency of alternate approaches.  ...  Nearly all learning-based approaches do not scale with larger input sets and are unable to match sufficiently fast on the Cartesian product.  ... 
doi:10.14778/1920841.1920904 fatcat:yxmus33jcnhs5kf6hqsara44ye

Cartesian Tree Subsequence Matching [article]

Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
2022 arXiv   pre-print
of a text string T such that S and P Cartesian-tree match.  ...  Two strings of equal length are said to Cartesian-tree match if their Cartesian trees are isomorphic. Park et al.  ...  The authors thank the anonymous referees for drawing our attention to reference [10] . 5 For the implementation of binary search trees, we used std::set in C++.  ... 
arXiv:2202.04349v2 fatcat:m5b5qosoz5ahjcqbqytpqmsitq

Learning moment-based fast local binary descriptor

Abdelkader Bellarbi, Nadia Zenati, Samir Otmane, Hayet Belghit
2017 Journal of Electronic Imaging (JEI)  
Therefore, we took the pairs 1∕4 (i.e., matching images 1 to 4) for each of wall, leuven, trees, and boat image sets from the Mikolajczyk dataset.  ...  The FAST-like detectors do not provide multiscale detection; therefore, ORB calculates a multiscale image and applies FAST to every scale.  ... 
doi:10.1117/1.jei.26.2.023006 fatcat:lsmwkcpolvhypapcgkadi4lcq4

Exchange Market for Complex Goods: Theory and Experiments

Eugene Fink, Josh Johnson, Jenny Hu
2004 Netnomics  
They have also designed algorithms for exchange markets, which support fast-paced trading of standardized goods.  ...  If the system finds several matches for an order, it should choose the match with the best price; for instance, the buy order in Figure 2 (a) should trade with the cheaper of the two sell orders.  ...  The dfs subroutine finds all matches for one Cartesian product using depth-first search in the indexing tree; it identifies all children of the root that match the first element of the Cartesian product  ... 
doi:10.1023/b:netn.0000023379.66597.7c fatcat:x5toxy6sa5fefdotwj2z3kin2q

An Imaging Sensor-Aided Vision Navigation Approach that Uses a Geo-Referenced Image Database

Yan Li, Qingwu Hu, Meng Wu, Yang Gao
2016 Sensors  
The organization model of the image database is combined with robust feature matching to realize matching with fast searching; these methods are the key techniques in GRID-based vision navigation.  ...  Third, a robust image matching algorithm is presented to search for and match RTIs with GRID; the matched image is then matched with the real-time scene to calculate the 3D navigation parameter of the  ...  Author Contributions: Yan Li wrote the main program and most of the paper; Qingwu Hu conceived the study and designed the experiments; Meng Wu studied the image matching and 3D Navigation calculation approach  ... 
doi:10.3390/s16020166 pmid:26828496 pmcid:PMC4801544 fatcat:e7wkx7yeofewvc4wct3usem7du

A kernel independent fast multipole algorithm for radial basis functions

Lexing Ying
2006 Journal of Computational Physics  
We present a fast multipole algorithm for the evaluation of pairwise interaction through the radial basis functions such as 1/r a , √ r 2 + a 2 and 1/ √ r 2 + a 2 (with a > 0) in both two and three dimensions  ...  Our algorithm is an extension of the kernel independent fast multipole method presented in [9] . Numerical results are provided to illustrate the accuracy and complexity properties of the algorithm.  ...  In actual numerical implementation, the discretized upwards equivalent density is supported on an evenly sampled Cartesian grid of ∂B, while the check potential is matched at an evenly sampled Cartesian  ... 
doi:10.1016/j.jcp.2005.09.010 fatcat:6czwwvr5xbd3rkogatsvinjtiq

Exchange market for complex commodities: search for optimal matches

Eugene Fink, Jianli Gong, Josh Johnson
2007 Journal of experimental and theoretical artificial intelligence (Print)  
We describe the representation and indexing of orders, and give algorithms for fast identification of matches between buy and sell orders.  ...  The system identifies the most preferable matches, which maximize trader satisfaction; it allows control over the trade-off between speed and optimality of matching.  ...  The algorithm in The product-leaves subroutine finds the matching leaves for one Cartesian product using depth-first search in the indexing tree.  ... 
doi:10.1080/09528130600999741 fatcat:gncynfa37fgnthmin7w2pdylaa

An FMM Based on Dual Tree Traversal for Many-Core Architectures

R. Yokota
2013 Journal of Algorithms & Computational Technology  
The current N-body solver uses a fast multipole method with an efficient strategy for finding the list of cell-cell interactions by a dual tree traversal.  ...  A preliminary feasibility study for Exascale machines [15] indicates that the necessary bandwidth for FFT could only be provided by a fat-tree or hypercube network.  ...  The fast multipole method (FMM) is a fast algorithm that reduces the complexity of the N-body problem from O(N 2 ) to O(N ).  ... 
doi:10.1260/1748-3018.7.3.301 fatcat:kb5cssyhancb3ft65bi4czbwve

Stripy: A Python module for (constrained) triangulation in Cartesian coordinates and on a sphere

Louis Moresi, Ben Mather
2019 Journal of Open Source Software  
Our package, stripy, is a python, numpy-based interface to the TRIPACK and STRIPACK Fortran code for (constrained) triangulation in Cartesian coordinates and on a sphere, respectively (Renka, 1996a (Renka  ...  The notebooks are split into matching sets for spherical and Cartesian triangulations.  ...  The optional k-d tree methods on the meshes require the scipy.spatial module.  ... 
doi:10.21105/joss.01410 fatcat:dafyxauaavgyfmzozydnsaihby

An FMM Based on Dual Tree Traversal for Many-core Architectures [article]

Rio Yokota
2012 arXiv   pre-print
The current N-body solver uses a fast multipole method with an efficient strategy for finding the list of cell-cell interactions by a dual tree traversal.  ...  The present work attempts to integrate the independent efforts in the fast N-body community to create the fastest N-body library for many-core and heterogenous architectures.  ...  The fast multipole method (FMM) is a fast algorithm that reduces the complexity of the N-body problem from O(N 2 ) to O(N ).  ... 
arXiv:1209.3516v3 fatcat:u6y27ylz45adxbt33evhdfifmu

CoverBLIP: scalable iterative matched filtering for MR Fingerprint recovery [article]

Mohammad Golbabaee, Zhouye Chen, Yves Wiaux, Mike E. Davies
2018 arXiv   pre-print
Current proposed solutions for the high dimensionality of the MRF reconstruction problem rely on a linear compression step to reduce the matching computations and boost the efficiency of fast but non-scalable  ...  Leveraging on these results, we accelerate matched-filtering using an ANNS algorithm based on Cover trees with a robustness feature against the curse of dimensionality.  ...  fast but non-scalable searching schemes such as the KD-trees 4 .  ... 
arXiv:1809.02503v1 fatcat:fy4lxnpzpbewbgrsmu6rziyezq
« Previous Showing results 1 — 15 out of 13,453 results