Scalable and Approximate Matching PPRL Techniques
Designing Approximate Computing Circuits with Scalable and Systematic Data-Driven Techniques
... circuits, which correspond to the data-independent compensation circuits. Since different input data result in different error distributions, the number of compensation bits is determined by the error dynamic range and ...
53
Approximate inference in massive MIMO scenarios with moment matching techniques
... This information is provided by the so-called probabilistic symbol detector, see System Model in I.2, which has to marginalize the joint posterior pdf of the transmitted vector of QAM symbols, given the channel ...
109
Scalable and approximate privacy-preserving record linkage
... identified. PPRL techniques can solve this problem by performing the matching of long texts (considered as records) without disclosing the confidentiality to any ...
199
Scalable Matching and Ranking for Network Search
... introduces matching and ranking for network search ...for matching and ranking, which is configurable to support different types of management applications—from exact matching for database-style ...
9
Simple and Efficient Algorithm for Approximate Dictionary Matching
... for approximate dictio- nary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap ...dictionary matching on three large-scale datasets that include person names, ...
9
TASM: Top-k Approximate Subtree Matching
... Evaluating the tree edit distance for large XML trees is difficult: the best known algorithms have cubic runtime and quadratic space complexity, and, thus, do not scale. Our solution is TASMpostorder, a memory-efficient ...
15
A black box for online approximate pattern matching
... In many situations such as when monitoring Internet traffic or telecommunications networks this model of computation may not be feasible. It is not sufficient simply that a pattern matching algorithm runs fast. It ...
6
Boosting the Quality of Approximate String Matching by Synonyms
... these techniques cannot be directly applied here, since given a specific filter, our goal is to estimate the cardinality of candidates, which is often much greater than that of final ...
42
Evaluation of approximate pattern matching algorithms for OCR texts
... But approximate string matching is only one way to tackle this problem; an interesting alternative research direction could be machine learning techniques, for example, so that the lists of valid ...
9
File Detection in Network Traffic Using Approximate Matching
... Chapter 7 Conclusion & Future Work The problem of data loss has become an important problem and a robust solu- tion is need of the hour. Possible routes of data loss have become complicated and numerous, making ...
106
mrsh-mem: Approximate Matching on Raw Memory Dumps
... Considerations: Discussing the examination of the Ker- nel .text section in memory leads to the question if MRSH-MEM can be used for detecting advanced Kernel infection techniques. Different hijacking ...
32
File Detection on Network Traffic Using Approximate Matching
... 300 Boston Post Rd, New Haven, CT, 06511 {FBreitinger,IBaggili}@newhaven.edu ABSTRACT In recent years, Internet technologies changed enormously and allow faster Internet connections, higher data rates and mobile usage. ...
15
MAGE: Matching Approximate Patterns in Richly-Attributed Graphs
... edges, say a social network where both its nodes and edges have multiple attributes (e.g., job titles, tie strengths), how to quickly find subgraphs of interest (e.g., a ring of businessmen with strong ties)? We present ...
6
Approximate Semantic Matching Over Linked Data Streams
... Hashing techniques to transform Linked Data streams and user queries into numerical ...semantic matching based on the naive kNN classification ...straightforward matching approach with thousands of ...
16
Improved Distributed Approximate Matching
... c y [i]/n y (using the c array computed by Algorithm 3). If we are at a node x ∈ X, we just follows the unique matching edge incident with x. In the algorithm, all leaders y send a token message car- rying their ...
8
Approximating Approximate Pattern Matching
... For reporting all Hamming distances, Abrahamson [1] described an algorithm with the complexity of O(n √ m log m). Using a similar approach, the same complexity was obtained in [18] and later in conference works [3, 5] ...
13
Approximate Matching for Evaluating Keyphrase Extraction
... the approximate matching strategy is better suited to assess the performance of keyphrase extraction ...the matching strategy as well as on the properties of the evaluation dataset es- pecially the ...
6
On the Database Lookup Problem of Approximate Matching
... (2013a). Basically approximate matching consists of two sepa- rate functions. First, tools run a feature extraction function that extracts features or attributes from the input that allow a compressed ...
10
On the database lookup problem of approximate matching
... (2013a). Basically approximate matching consists of two sepa- rate functions. First, tools run a feature extraction function that extracts features or attributes from the input that allow a compressed ...
9
Approximate matching in grammar-compressed strings
... string-substring LCS: string a vs every substring of b prefix-suffix LCS: every prefix of a vs every suffix of b symmetrically, substring-string and suffix-prefix LCS The three-way semi-[r] ...