Filters








150,535 Hits in 6.6 sec

Shortest Paths and Distances with Differential Privacy [article]

Adam Sealfon
<span title="2016-04-20">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In our model, two weight functions w,w' are considered to be neighboring if they have ℓ_1 distance at most one.  ...  We are concerned with the approximation error, the difference between the length of the released path or released distance and the length of the shortest path or actual distance.  ...  Acknowledgments I am grateful to Salil Vadhan and Shafi Goldwasser for their guidance and encouragement throughout this project.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1511.04631v2">arXiv:1511.04631v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g6boiv7rgzcehp4k37i4nzx3iy">fatcat:g6boiv7rgzcehp4k37i4nzx3iy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200929072601/https://arxiv.org/pdf/1511.04631v2.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/09/d1/09d133d02c888852ee348200b64345cb403b0010.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1511.04631v2" 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>

Algorithms for Forest Pattern Matching [chapter]

Kaizhong Zhang, Yunkun Zhu
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
• Edit Operations • General change l 1 l 2 delete l 1 l 1 l 2 insert l 1 l 1 l 2 distance function γ: (1) γ(a, b) ≥ 0; (2) γ(a, b) = γ(b, a); (3) γ(a, c) ≤ γ(a, b) + γ(b, c); (4) γ(a, b) = 0 if δ(F 1  ...  Sequence Approximate Pattern Matching (SAPM) Introduction Forest Edit Distance Finding A Most Similar Closed Subforest • Problem Statement • Sequence Approximate Pattern Matching • Finding  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-13509-5_1">doi:10.1007/978-3-642-13509-5_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zxeagrov6jcm7l3bqd6yi4bieq">fatcat:zxeagrov6jcm7l3bqd6yi4bieq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170223150812/http://www.cs.ucr.edu/~stelo/cpm/cpm10/1.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/54/06/54064d8e63e7fe77cf372f6d000613637e853494.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-642-13509-5_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Subject Index

<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/usw2n4yaarcurchx7i4on2iqea" style="color: black;">Journal of Discrete Algorithms</a> </i> &nbsp;
problem, 448 Annuli Optimizing a constrained convex polygonal annu- lus, 1 Approximate string matching Indexing text with approximate q-grams, 157; Bit- parallel (δ, γ )-matching and suffix automata  ...  hop count on ATM tree networks, 101 Bioinformatics Distributed suffix trees, 176 Bit-parallelism Bit-parallel (δ, γ )-matching and suffix automata, 198; Bit-parallel approximate string matching  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1570-8667(05)00042-0">doi:10.1016/s1570-8667(05)00042-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/phytlwupp5hmtddg3ffue5546u">fatcat:phytlwupp5hmtddg3ffue5546u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171002135624/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/b85/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTU3MDg2NjcwNTAwMDQyMA%3D%3D.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/bd/88/bd88f9211b9722b04e8a17d6309a7664ad667a85.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1570-8667(05)00042-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Approximate congruence in nearly linear time

Piotr Indyk, Suresh Venkatasubramanian
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/is2k7576zbherpepqy3y7zkzuy" style="color: black;">Computational geometry</a> </i> &nbsp;
Using a novel application of Hall's Theorem to reduce the geometric matching problem to a combinatorial matching problem, we present near-linear time approximation schemes for minimising this distance  ...  This result yields improved algorithms for approximate congruence, and may be of independent interest.  ...  All our results are for computing the approximate generalized bottleneck distance under translations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0925-7721(02)00095-0">doi:10.1016/s0925-7721(02)00095-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pirpfzdebvcwxbhlcbbknxrepy">fatcat:pirpfzdebvcwxbhlcbbknxrepy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050601011859/http://www.research.att.com:80/~suresh/papers/hallj/hallj.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/41/68/4168e739e9d80190e5c5b636e8e17d7547f1ce2a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0925-7721(02)00095-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Approximate Nearest Neighbors in the Space of Persistence Diagrams [article]

Brittany Terese Fasy, Xiaozhou He, Zhihui Liu, Samuel Micka, David L. Millman, Binhai Zhu
<span title="2021-03-22">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Furthermore, as the lattice parameter decreases, searching our data structure yields a six-approximation of the nearest diagram in Γ in O((mlogn+m^2)logτ) time and a constant factor approximation of the  ...  Given a set Γ of n (M,m)-bounded persistence diagrams, each with at most m points, we snap-round the points of each diagram to points on a cubical lattice and produce a key for each possible snap-rounding  ...  Sheehy for directing us to additional searching approaches and feedback on early drafts, and Brendan Mumey for the discussions related to this research and pointing out the paper by Heffernan and Schirra  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1812.11257v2">arXiv:1812.11257v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2glpbegjwjdihk2terugdwldhi">fatcat:2glpbegjwjdihk2terugdwldhi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210326023153/https://arxiv.org/pdf/1812.11257v2.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/40/a3/40a3566f45d860e631e0977c6e7efd438e1ee91d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1812.11257v2" 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>

Algorithms for the Transportation Problem in Geometric Settings [chapter]

R. Sharathkumar, Pankaj K. Agarwal
<span title="2012-01-17">2012</span> <i title="Society for Industrial and Applied Mathematics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ja7dpjgz2nhjlovlil3ij5m7ei" style="color: black;">Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms</a> </i> &nbsp;
Suppose we run the primal-dual algorithm on A and B, under a distance function d(·, ·).  ...  a∈A da = b∈B s b = U and let d(·, ·) be a distance function. Suppose the diameter of A ∪ B is ∆ under d(·, ·), and ε > 0 is a parameter.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9781611973099.29">doi:10.1137/1.9781611973099.29</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/soda/SharathkumarA12.html">dblp:conf/soda/SharathkumarA12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ltatcgniv5fxfiwik2o5w6cnu4">fatcat:ltatcgniv5fxfiwik2o5w6cnu4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170201162140/https://users.cs.duke.edu/~pankaj/publications/papers/transport.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/89/99/899957592d612924603d428ca0f0b0024c16fe74.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9781611973099.29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Approximating (k,ℓ)-center clustering for curves [article]

Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler, Martijn Struijs
<span title="2018-07-20">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This result also holds when k=1, and the NP-hardness extends to the case that ℓ=∞, i.e., for the problem of computing the minimum-enclosing ball under the Fréchet distance.  ...  Our constructions yield different bounds for one and two-dimensional curves and the discrete and continuous Fréchet distance.  ...  As d DF (γ(s), c * ) ≤ 1, there exists a matching between γ(s) and c * such that all matched pairs have distance at most 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1805.01547v2">arXiv:1805.01547v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j2t2v3ywwbfpdpejzy4tytho6y">fatcat:j2t2v3ywwbfpdpejzy4tytho6y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200908153459/https://arxiv.org/pdf/1805.01547v2.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/95/61/95613a8f73e1d0d2c09e07bd4f096bbdfa82ea41.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1805.01547v2" 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>

Time Warp Edit Distance with Stiffness Adjustment for Time Series Matching

P.-F. Marteau
<span title="">2009</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3px634ph3vhrtmtuip6xznraqi" style="color: black;">IEEE Transactions on Pattern Analysis and Machine Intelligence</a> </i> &nbsp;
Compared to Edit Distance, Dynamic Time Warping, Longest Common Subsequnce and Edit Distance with Real Penalty, TWED has proven to be quite effective on the considered experimental task.  ...  To define the "edit operations" we use the paradigm of a graphical editing process and end up with a dynamic programming algorithm that we call Time Warp Edit Distance (TWED).  ...  Proposition 3: γ λ δ , is an increasing function of γ λ and : ) , ( ) , ( , ' ' 0 , 0 ' , ' , 2 Y X Y X U Y X γ λ γ λ δ δ γ γ λ λ γ λ ≤ ∈ ∀ ≥ ∀ ≥ ∀ > ≥ ∀ The proof is given in [25] . D.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpami.2008.76">doi:10.1109/tpami.2008.76</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/19110495">pmid:19110495</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mdalo7eyefc33nn7dwhztc4soa">fatcat:mdalo7eyefc33nn7dwhztc4soa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922163234/https://hal.archives-ouvertes.fr/hal-00135473/document" 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/95/5f/955f4f7e2716ccf41465de96d983a5154624f31f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpami.2008.76"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Estimating summary statistics in the spike-train space

Wei Wu, Anuj Srivastava
<span title="2012-10-05">2012</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2awqvcobm5bw3bostcqrykczhe" style="color: black;">Journal of Computational Neuroscience</a> </i> &nbsp;
To directly capture and analyze the average and variability in the observation space of the spike trains, we focus on a data-driven approach where statistics are defined and computed in a function space  ...  Based on the definition of a "Euclidean" metric, a recent paper introduced the notion of the mean of a set of spike trains and developed an efficient algorithm to compute it under some restrictive conditions  ...  Acknowledgements This research is supported in part by the grants NSF IIS-0916154 to WW and NSF DMS-0915003, ONR N00014-09-1-0664, and AFOSR FA9550-06-1-0324 to AS. We thank Prof.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10827-012-0427-3">doi:10.1007/s10827-012-0427-3</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/23053864">pmid:23053864</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4cnbs45jf5dadcouf3qqdw2ysi">fatcat:4cnbs45jf5dadcouf3qqdw2ysi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130107222151/http://stat.fsu.edu/~wwu/papers/WuSrivastavaJCNS_Online12.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/fb/c4/fbc40b1a61ecea103ce0416061337e371824657b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10827-012-0427-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Approximation of LRU Caches Miss Rate: Application to Power-law Popularities [article]

Christian Berthet
<span title="2017-05-19">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Fagin, we give a closed-form expression for the approximated Miss Rate (MR) of LRU Caches assuming a power-law popularity.  ...  In addition, we bring a new analysis of the conditions (cache relative size, popularity parameter) under which the ratio of LRU MR to Static MR is worst-case.  ...  In Section 3 we introduce Fagin approximation for LRU Miss Rate under IRM and see how it has been recently rediscovered under the "Che's approximation" label.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.10738v1">arXiv:1705.10738v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/utprdvnqhfcbzavearlzqqjzqm">fatcat:utprdvnqhfcbzavearlzqqjzqm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200929130513/https://arxiv.org/ftp/arxiv/papers/1705/1705.10738.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/63/fd/63fdd06a3469c05f4075731607ece590e4c8b24e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.10738v1" 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>

Gravitational wave chirp search: Economization of post-Newtonian matched filter bank via cardinal interpolation

R. P. Croce, Th. Demma, V. Pierro, I. M. Pinto, D. Churches, B. S. Sathyaprakash
<span title="2000-11-20">2000</span> <i title="American Physical Society (APS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hxy6dwftx5gd3fs6pgg2h3b4vm" style="color: black;">Physical Review D, Particles and fields</a> </i> &nbsp;
match) is 0.97.  ...  Gravitational radiation emitted during this phase will have to be dug out of noise by matched-filtering (correlating) the detector output with a bank of several 10^5 templates, making the computational  ...  Pinto wishes to thank the TAMA staff at NAO and in particular prof. Fujimoto Masa-Katsu and prof. Kawamura Seiji for gracious hospitality and stimulating discussions. D. Churches and B.S.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physrevd.62.121101">doi:10.1103/physrevd.62.121101</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zyeufns5inhwnpyszjefvfm45y">fatcat:zyeufns5inhwnpyszjefvfm45y</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-gr-qc0008059/gr-qc0008059.pdf" title="fulltext PDF download [not primary version]" 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> File Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2b/be/2bbecea9307a508777362dcf7fb3ddfe4b16a2df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physrevd.62.121101"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> aps.org </button> </a>

Detecting protein sequence conservation via metric embeddings

E. Halperin, J. Buhler, R. Karp, R. Krauthgamer, B. Westover
<span title="2003-07-03">2003</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wmo54ba2jnemdingjj4fl3736a" style="color: black;">Bioinformatics</a> </i> &nbsp;
We first propose a new distance function on peptides derived from a given score matrix.  ...  Given two databases, one must find all pairs of proteins that align with high score under a biologically meaningful substitution score matrix, such as a BLOSUM matrix (Henikoff and Henikoff, 1992) .  ...  ACKNOWLEDGEMENTS The first, third and fourth authors were supported in part by NSF grants CCR-9820951 and CCR-0121555 and DARPA cooperative agreement F30602-00-2-0601.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/bioinformatics/btg1016">doi:10.1093/bioinformatics/btg1016</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/12855448">pmid:12855448</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/alv3vpswnzbopiwwjxmd2nvtbe">fatcat:alv3vpswnzbopiwwjxmd2nvtbe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706113909/http://www.wisdom.weizmann.ac.il/~robi/papers/HBKKW-ProteinConservation-ISMB03.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/a0/fc/a0fc5436f6384edca7071af235569a8df1355774.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/bioinformatics/btg1016"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>

Integral invariants for space motion trajectory matching and recognition

Zhanpeng Shao, Youfu Li
<span title="">2015</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jm6w2xclfzguxnhmnmq5omebpi" style="color: black;">Pattern Recognition</a> </i> &nbsp;
Then a non-linear distance of the integral invariants is defined to measure the similarity for trajectory matching and recognition.  ...  Experimental results on trajectory matching and sign recognition show the effectiveness and robustness of the proposed integral invariants in motion trajectory matching and recognition.  ...  A distance function between their integral invariants is defined to measure the similarity between them to match, cluster, and classify motion trajectories.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.patcog.2015.02.029">doi:10.1016/j.patcog.2015.02.029</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ru2rhjzxzzh3hiusm4n3a6ycmy">fatcat:ru2rhjzxzzh3hiusm4n3a6ycmy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808234758/http://personal.cityu.edu.hk/~meyfli/Publication/file/ZP_PR15.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/16/b5/16b57e5a5915727cf5ebffa31cb433bb5da5a8e1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.patcog.2015.02.029"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

On the Hardness of Computing an Average Curve

Kevin Buchin, Anne Driemel, Martijn Struijs, Susanne Albers
<span title="">2020</span> <i title="Schloss Dagstuhl - Leibniz-Zentrum für Informatik"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/234nrfv6afgy5j63gqriarhryq" style="color: black;">Scandinavian Workshop on Algorithm Theory</a> </i> &nbsp;
We show this under the discrete and continuous Fréchet and Dynamic Time Warping (DTW) distance.  ...  We study the complexity of clustering curves under k-median and k-center objectives in the metric space of the Fréchet distance and related distance measures.  ...  Our approximation algorithms rely on the fact that good approximations have small distance to some optimal solution and that we can search a bounded space (the set of balls surrounding the vertices) for  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.swat.2020.19">doi:10.4230/lipics.swat.2020.19</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/swat/BuchinDS20.html">dblp:conf/swat/BuchinDS20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v2vpa6a4yzb35embffcm52i2ia">fatcat:v2vpa6a4yzb35embffcm52i2ia</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201213222022/https://drops.dagstuhl.de/opus/volltexte/2020/12266/pdf/LIPIcs-SWAT-2020-19.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/61/2d/612ddac4e67d829c310feba0f1eda5b39f7cd1d0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.swat.2020.19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Beam emittance preservation using Gaussian density ramps in a beam-driven plasma wakefield accelerator

M. D. Litos, R. Ariniello, C. E. Doss, K. Hunt-Stone, J. R. Cary
<span title="2019-06-24">2019</span> <i title="The Royal Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ercgg4vn2fenngurcnadfzdfri" style="color: black;">Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences</a> </i> &nbsp;
Small longitudinal variations of the plasma density n p and/or the beam Lorentz factor γ b lead to the approximation k β k β,0 (1 − δ/2), where δδ n − δ γ − (3/4)δ 2 n + (9/4)δ 2 γ − (1/2)δ n δ γ to  ...  second order in δ n and δ γ .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1098/rsta.2018.0181">doi:10.1098/rsta.2018.0181</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rxe7yxjxkjg6nonizru6ttw2km">fatcat:rxe7yxjxkjg6nonizru6ttw2km</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191026221108/https://royalsocietypublishing.org/doi/pdf/10.1098/rsta.2018.0181" 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] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1098/rsta.2018.0181"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 150,535 results