Filters








1,001 Hits in 10.5 sec

Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant

Brian Brubach, Marc Herbstritt
<span title="2018-05-11">2018</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cpozivjjrjdjbodfq76vaaxdpm" style="color: black;">Annual Symposium on Combinatorial Pattern Matching</a> </i> &nbsp;
We present a new approach to approximating the Maximum Duo-Preservation String Mapping Problem (MPSM) based on massaging the constraints into a tractable matching problem.  ...  Recently, Mehrabi [28] introduced the more general weighted variant, Maximum Weight Duo-Preservation String Mapping (MWPSM) and provided a 6-approximation.  ...  Acknowledgements The author wishes to thank advisors Mihai Pop and Aravind Srinivasan for their support, guidance, and encouragement.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.cpm.2018.5">doi:10.4230/lipics.cpm.2018.5</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cpm/Brubach18.html">dblp:conf/cpm/Brubach18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/krm5t2xwmje5npcy3rbvoeq4gm">fatcat:krm5t2xwmje5npcy3rbvoeq4gm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220126063211/https://drops.dagstuhl.de/opus/volltexte/2018/8706/pdf/LIPIcs-CPM-2018-5.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/82/dd/82dd1e74cd2ca97968e1078801d1fb1ff6d0d0a2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.cpm.2018.5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Approximating Weighted Duo-Preservation in Comparative Genomics [chapter]

Saeed Mehrabi
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper, we introduce a generalized version of the problem, called the Maximum-Weight Duo-preservation String Mapping (MWDSM) problem that captures both duos-preservation and duos-distance measures  ...  Motivated by comparative genomics, Chen et al. [9] introduced the Maximum Duo-preservation String Mapping (MDSM) problem in which we are given two strings s 1 and s 2 from the same alphabet and the goal  ...  Conclusion In this paper, we studied a weighted version of the MDSM problem [9] that considers the position of the preserved duos in the respective input strings (i.e., the MWDSM problem).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-62389-4_33">doi:10.1007/978-3-319-62389-4_33</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2mli3xgyrnacjoial2zmgcgaom">fatcat:2mli3xgyrnacjoial2zmgcgaom</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190216063223/http://pdfs.semanticscholar.org/01b8/b27146005449692bda99bf601a5cd31678c8.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/01/b8/01b8b27146005449692bda99bf601a5cd31678c8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-62389-4_33"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Approximating Weighted Duo-Preservation in Comparative Genomics [article]

Saeed Mehrabi
<span title="2017-08-30">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we introduce a generalized version of the problem, called the Maximum-Weight Duo-preservation String Mapping (MWDSM) problem that captures both duos-preservation and duos-distance measures  ...  Motivated by comparative genomics, Chen et al. [9] introduced the Maximum Duo-preservation String Mapping (MDSM) problem in which we are given two strings s_1 and s_2 from the same alphabet and the goal  ...  Conclusion In this paper, we studied a weighted version of the MDSM problem [9] that considers the position of the preserved duos in the respective input strings (i.e., the MWDSM problem).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1708.09325v1">arXiv:1708.09325v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/op67x7nmdvdr3illdmdadvfeca">fatcat:op67x7nmdvdr3illdmdadvfeca</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200908205200/https://arxiv.org/pdf/1708.09325v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/28/46/2846df0b992412ae21fd2c092ea813a449fa1af8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1708.09325v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Parameterized tractability of the maximum-duo preservation string mapping problem

Stefano Beretta, Mauro Castelli, Riccardo Dondi
<span title="">2016</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common String Partition Problem.  ...  We show that this problem is fixed-parameter tractable when parameterized by the number k of conserved duos, by first giving a parameterized algorithm based on the color-coding technique and then presenting  ...  Acknowledgments We would like to thank the anonymous reviewers for very helpful and constructive comments that led to a significant improvement of the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2016.07.011">doi:10.1016/j.tcs.2016.07.011</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s5tuejshojgzddjbmdx3rkflly">fatcat:s5tuejshojgzddjbmdx3rkflly</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180512153121/https://aisberg.unibg.it/retrieve/handle/10446/78349/129857/MaxDuo.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a1/a6/a1a677531ecaa6952f0cf139ac0bf2eee0beef1d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2016.07.011"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem [article]

Stefano Beretta, Mauro Castelli, Riccardo Dondi
<span title="2015-12-10">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common String Partition Problem.  ...  We show that this problem is fixed-parameter tractable when parameterized by the number k of conserved duos, by first giving a parameterized algorithm based on the color-coding technique and then presenting  ...  Maximum-Duo Preservation String Mapping Problem (Max-Duo PSM) Input: two related strings A and B, an integer k.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1512.03220v1">arXiv:1512.03220v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ddxcvyqchrerlnil5ms2icubvm">fatcat:ddxcvyqchrerlnil5ms2icubvm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200929023622/https://arxiv.org/pdf/1512.03220v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/df/6f/df6f436073b6580dfdf2631ec8de24f87200be49.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1512.03220v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A $$(1.4 + \epsilon )$$-approximation algorithm for the 2-Max-Duo problem

Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang
<span title="2020-07-25">2020</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tsm6lnbvf5ahzjp7czojbjig5i" style="color: black;">Journal of combinatorial optimization</a> </i> &nbsp;
The maximum duo-preservation string mapping (Max-Duo) problem is the complement of the well studied minimum common string partition (MCSP) problem, both of which have applications in many fields including  ...  In particular, 2-Max-Duo can then be approximated arbitrarily close to 1.8 using the state-of-the-art approximation algorithm for the MIS problem. 2-Max-Duo was proved APX-hard and very recently a (1.6  ...  With the complementary objective to that of MCSP, the problem of maximizing the number of duos preserved in the common partition is referred to as the maximum duo-preservation string mapping problem by  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10878-020-00621-0">doi:10.1007/s10878-020-00621-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hhl5ska7vne35kbkqen2bad42u">fatcat:hhl5ska7vne35kbkqen2bad42u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180507141003/http://drops.dagstuhl.de/opus/volltexte/2017/8212/pdf/LIPIcs-ISAAC-2017-66.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/62/32/6232c565f5580f863d0c7d18b715e73faaf9f4f7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10878-020-00621-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem [article]

Bartłomiej Dudek, Paweł Gawrychowski, Piotr Ostropolski-Nalewaja
<span title="2017-05-30">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In the Maximum Duo-Preservation String Mapping problem we are given two strings and wish to map the letters of the former to the letters of the latter so as to maximise the number of duos.  ...  Maximum Duo-Preservation String Mapping is APX-hard. After a series of improvements, Brubach [WABI 2016] showed a polynomial-time 3.25-approximation algorithm.  ...  There was also some interest in the complementary problem called the Maximum Duo-Preservation String Mapping (MPSM), introduced by Chen et al. [7] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1702.02405v2">arXiv:1702.02405v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/56kof6g7rndkbhruhykwlalqb4">fatcat:56kof6g7rndkbhruhykwlalqb4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200828114905/https://arxiv.org/pdf/1702.02405v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/58/7a/587a55fe9a9532bc549da57ae8f5f3211bd5a76c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1702.02405v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A (1.4 + ϵ)-approximation algorithm for the 2-Max-Duo problem [article]

Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang
<span title="2017-09-05">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The maximum duo-preservation string mapping (Max-Duo) problem is the complement of the well studied minimum common string partition (MCSP) problem, both of which have applications in many fields including  ...  In particular, 2-Max-Duo can then be approximated arbitrarily close to 1.8 using the state-of-the-art approximation algorithm for the MIS problem. 2-Max-Duo was proved APX-hard and very recently a (1.6  ...  With the complementary objective to that of MCSP, the problem of maximizing the number of duos preserved in the common partition is referred to as the maximum duo-preservation string mapping problem by  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1702.06256v2">arXiv:1702.06256v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qj5xgh6t6vbplcj4brbfjsicuy">fatcat:qj5xgh6t6vbplcj4brbfjsicuy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200912200315/https://arxiv.org/pdf/1702.06256v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/03/64/0364964eb975cd60b352409c414f9cb82f214eaf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1702.06256v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A local search 2.917-approximation algorithm for duo-preservation string mapping [article]

Yao Xu, Yong Chen, Taibo Luo, Guohui Lin
<span title="2017-02-07">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study the maximum duo-preservation string mapping ( Max-Duo) problem, which is the complement of the well studied minimum common string partition ( MCSP) problem.  ...  This beats the current best 3.25-approximation for Max-Duo. The performance analysis of our algorithm is done through a complex yet interesting amortization.  ...  The complementary objective to that of MCSP is to maximize the number of duos preserved in the common partition, which is referred to as the maximum duo-preservation string mapping (Max-Duo) problem by  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1702.01877v1">arXiv:1702.01877v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oov6ohrczvg77gafebdr6kiugm">fatcat:oov6ohrczvg77gafebdr6kiugm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191023182425/https://arxiv.org/pdf/1702.01877v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/03/b1/03b16ce646d78f1100f458af070ff7ade642d20f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1702.01877v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Privacy-preserving speaker verification as password matching

Manas A. Pathak, Bhiksha Raj
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rc5jnc4ldvhs3dswicq5wk3vsq" style="color: black;">2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</a> </i> &nbsp;
they map to the same string.  ...  This transformation, therefore, reduces the problem of identifying nearest neighbors to string comparison.  ...  A set of data points that map to the same key are considered as approximate nearest neighbors.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icassp.2012.6288262">doi:10.1109/icassp.2012.6288262</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icassp/PathakR12.html">dblp:conf/icassp/PathakR12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/d3mersvjgvckfpbwvos2ic2dfa">fatcat:d3mersvjgvckfpbwvos2ic2dfa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130203113826/http://mlsp.cs.cmu.edu:80/publications/pdfs/svlsh.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5a/dd/5add757ab5913e0554af1c8e652fc9cd049bdff2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icassp.2012.6288262"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Computing Genomic Distances: An Algorithmic Viewpoint [chapter]

Guillaume Fertin, Irena Rusu
<span title="2010-12-23">2010</span> <i title="John Wiley &amp; Sons, Inc."> Algorithms in Computational Molecular Biology </i> &nbsp;
Finally, given any solution for UMCSP, if a duo d from P does not appear in P, the we say that d is broken. A first approximation algorithm for UMCSP.  ...  More precisely, we present several algorithms that were proposed recently for solving (exactly or approximately) several variants of the problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/9780470892107.ch34">doi:10.1002/9780470892107.ch34</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4aqmnbegx5dlzkpwlfvvok425u">fatcat:4aqmnbegx5dlzkpwlfvvok425u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190418041731/https://core.ac.uk/download/pdf/53011186.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fc/1b/fc1b07b1dc970a50177eb9fa775e945225b7da81.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/9780470892107.ch34"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Parameterized Algorithms in Bioinformatics: An Overview

Laurent Bulteau, Mathias Weller
<span title="2019-12-01">2019</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/63zsvf7vxzfznojpqgfvpyk2lu" style="color: black;">Algorithms</a> </i> &nbsp;
Aside from reporting the state of the art, we give challenges and open problems for each topic.  ...  This work surveys recent developments of parameterized algorithms and complexity for important NP-hard problems in bioinformatics.  ...  Acknowledgments: The authors want to thank Fran Rosamond for suggesting the topic as well as everyone who helped collect interesting results for the manuscript, in particular Jesper Jansson, Steven Kelk  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/a12120256">doi:10.3390/a12120256</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4dhjdnpibzh43iifgan2fu6bwa">fatcat:4dhjdnpibzh43iifgan2fu6bwa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200213035509/https://res.mdpi.com/d_attachment/algorithms/algorithms-12-00256/article_deploy/algorithms-12-00256-v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/71/5f/715fdbea73d0f7a1c20ac935c66fd8d113851989.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/a12120256"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

A Gram-Based String Paradigm for Efficient Video Subsequence Search

Zi Huang, Jiajun Liu, Bin Cui, Xiaoyong Du
<span title="">2013</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/sbzicoknnzc3tjljn7ifvwpooi" style="color: black;">IEEE transactions on multimedia</a> </i> &nbsp;
In VideoGram, the feature space is modeled as a set of visual words. Each database video sequence is mapped into a string.  ...  Inspired by the high efficiency of string indexing methods, in this paper, we present a string paradigm called VideoGram for large-scale video sequence indexing to achieve fast similarity search.  ...  On the other hand, in the query expansion process, a Likelihood-Visual-Word (LVW) for a high-dimensional query frame also carries the spatial similarity which can be preserved when mapping into the visual  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tmm.2012.2236307">doi:10.1109/tmm.2012.2236307</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tcopeotgkjd3rayabxpqoaxgw4">fatcat:tcopeotgkjd3rayabxpqoaxgw4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829145746/http://net.pku.edu.cn/~cuibin/Papers/2013tmm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cf/48/cf48f68635116d8ca44cff7c3f2ed59a61f71935.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tmm.2012.2236307"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Faster secure two-party computation with less memory

Wilko Henecka, Thomas Schneider
<span title="">2013</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rau5643b7ncwvh74y6p64hntle" style="color: black;">Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security - ASIA CCS &#39;13</a> </i> &nbsp;
Secure two-party computation is used as the basis for a large variety of privacy-preserving protocols, but often concerns about the low performance hinder the move away from nonprivate solutions.  ...  We implement improved circuit building blocks from the literature and present for the first time performance results for secure evaluation of the ultra-lightweight block cipher PRESENT within 7 ms online  ...  The authors would like to thank René Peralta for helpful discussions on efficient circuit constructions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2484313.2484369">doi:10.1145/2484313.2484369</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ccs/Henecka013.html">dblp:conf/ccs/Henecka013</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gu7ovx6co5d3ddmgcaov34cmzq">fatcat:gu7ovx6co5d3ddmgcaov34cmzq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812000145/http://thomaschneider.de/papers/HS13.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a6/51/a6518d716b43194e751569d0748896cacbfbf409.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2484313.2484369"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Parallel Genetic Algorithm for Pattern Recognition in Mixed Databases [chapter]

Angel Kuri-Morales, Javier Sagastuy-Breña
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Such individual is the best practical PPC for the MD. The computational complexity of this task is considerable.  ...  To do this we must consider the fact that there is a limited subset of codes which will preserve the patterns in the MD.  ...  For this experiment, the maximum number of generations for the EGA was set to 100 and the number of epochs the MLPs were trained for was set to 1000.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-59226-8_2">doi:10.1007/978-3-319-59226-8_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ln5rzwmvifgmvmum7ctp6x2clq">fatcat:ln5rzwmvifgmvmum7ctp6x2clq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190220090300/http://pdfs.semanticscholar.org/25fb/e02008a8789b73c9a102044d635649e9cc93.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/25/fb/25fbe02008a8789b73c9a102044d635649e9cc93.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-59226-8_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,001 results