2,573 Hits in 5.5 sec

Tractability and Approximability of Maximal Strip Recovery [chapter]

Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
2011 Lecture Notes in Computer Science  
We present a panel of new or improved FPT and approximation algorithms for the MSR problem and its variants.  ...  In this paper, we study the Maximal Strip Recovery problem (MSR) [Zheng et al. 07], which aims at finding an optimal decomposition of a set of genomes into synteny blocks, amidst possible noise and ambiguities  ...  Compared to the approximation upper bound of 2d [2, 1, 8] for the two maximization problems MSR-d and δ-gap-MSR-d, which almost matches (at least asymptotically) the current best lower bound of Ω(d/  ... 
doi:10.1007/978-3-642-21458-5_29 fatcat:vatgglm3c5gqrirbgb7q27tyiq

Exact polyhedral visual hulls

J.-S. Franco, E. Boyer
2003 Procedings of the British Machine Vision Conference 2003  
We propose an exact method for efficiently and robustly computing the visual hull of an object from image contours.  ...  Furthermore, the proposed approach is fast and allows real-time recovery of both manifold and watertight visual hull polyhedra. The process involves three main steps.  ...  V H c is the visual hull complement in 3 , D is the image visibility domain in 3 and D V is the complement of V relative to this domain.  ... 
doi:10.5244/c.17.32 dblp:conf/bmvc/FrancoB03 fatcat:scmwnpsyvza5pob3o7ccjgejje

Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems [chapter]

Binhai Zhu
2009 Lecture Notes in Computer Science  
We mainly focus on three problems: the exemplar breakpoint distance problem and its complement (i.e., the exemplar non-breaking similarity or the exemplar adjacency number problem), and the maximal strip  ...  In this paper, we present a survey of the approximability and fixed-parameter tractability results for some Exemplar Genomic Distance problems.  ...  Acknowledgments I would like to thank my collaborators for this series of research: Zhixiang Chen, Richard Fowler, Bin Fu, Minghui Jiang, Lusheng Wang, Jinhui Xu, Boting Yang, and Zhiyu Zhao.  ... 
doi:10.1007/978-3-642-02017-9_10 fatcat:x72s64rvwzcuxiabwtgwf2vbcq

Efficient Polyhedral Modeling from Silhouettes

J.-S. Franco, E. Boyer
2009 IEEE Transactions on Pattern Analysis and Machine Intelligence  
Such simplicity enables the algorithm to combine the advantages of being fast, producing pixel-exact surfaces, and repeatably yield manifold and watertight polyhedra in general experimental conditions  ...  This article provides an efficient algorithm to compute such a surface in the form of a polyhedral mesh.  ...  To this aim we propose to discretize occluding contours using an efficient, pixel-exact extraction algorithm (e.g.  ... 
doi:10.1109/tpami.2008.104 pmid:19147872 fatcat:rmqrxddzmzgolgvaxthaimndti

Tractability and approximability of maximal strip recovery

Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
2012 Theoretical Computer Science  
Given a set of d genomic maps each containing the same n markers without duplicates, the problem Maximal Strip Recovery (MSR) aims at finding a decomposition of the genomic maps into synteny blocks (strips  ...  In this paper, we present a collection of new or improved FPT and approximation algorithms for MSR and its variants.  ...  In this paper, we present a collection of new or improved FPT and approximation algorithms for the many variants of the maximal strip recovery problem.  ... 
doi:10.1016/j.tcs.2012.04.034 fatcat:f2of53b4zbdyvmmla2bslxmop4

On Comparing the Similarity and Dissimilarity Between Two Distinct Vehicular Trajectories

Letu Qingge, Peng Zou, Lihui Dai, Qing Yang, Binhai Zhu
2021 IEEE Access  
of adjacencies in A and B is maximized.  ...  On the other hand, when the adjacency involvement constraint is dropped, a variation of the problem is as hard as Exact Set Cover hence cannot be approximated within a constant factor unless P=NP.  ...  ACKNOWLEDGMENT The authors would like to thank anonymous reviewers for their comments and suggestions which greatly improve the presentation of this article.  ... 
doi:10.1109/access.2021.3061501 fatcat:epyrevte4rggpbp6b3a3bg3zra

Automatic segmentation framework for primary tumors from brain MRIs using morphological filtering techniques

Resmi S. Ananda, Tessamma Thomas
2012 2012 5th International Conference on BioMedical Engineering and Informatics  
Segmentation of the tumor and boundary detection is important because it can be used for surgical planning, treatment planning, textural analysis, 3-Dimensional modeling and volumetric analysis.  ...  This paper describes a novel framework for automatic segmentation of primary tumors and its boundary from brain MRIs using morphological filtering techniques.  ...  and validation of these results for this work.  ... 
doi:10.1109/bmei.2012.6512995 dblp:conf/bmei/AnandaT12 fatcat:4wuqodyw75djvpcxa7vxoskpi4

Issues in the Reconstruction of Gene Order Evolution

David Sankoff, Chunfang Zheng, Adriana Muñoz, Zhenyu Yang, Zaky Adam, Robert Warren, Vicky Choi, Qian Zhu
2010 Journal of Computer Science and Technology  
Multidisciplinary work undertakes to mathematically model these processes and to develop statistical analyses and mathematical algorithms to understand the scrambling in the chromosomes of two or more  ...  A major focus is the reconstruction of the gene order of the ancestral genomes.  ...  Siepel [36] and Caprara [37] gave exact median algorithms for small instances of d RT and Bourque [38] released a heuristic web application for this version of the problem.  ... 
doi:10.1007/s11390-010-9301-9 fatcat:x7mt6guq2naktbpre6bogfugmy

Reliable packet transmissions in multipath routed wireless networks

P. Djukic, S. Valaee
2006 IEEE Transactions on Mobile Computing  
With that information, the source can optimally distribute the fragments. We show how to distribute the fragments for minimized PPL, and maximized efficiency given a bound on PPL.  ...  We study the load balancing algorithm in two general cases. In the first case, we assume that no knowledge of the performance along the paths is available at the source.  ...  The Poisson approximation is a good replacement for the exact algorithm since very good values of P succ can be obtained in relatively few steps.  ... 
doi:10.1109/tmc.2006.72 fatcat:iswesnovlffn7kqor3h6ug2ah4

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)

Martin Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski, Marc Herbstritt
2011 Dagstuhl Reports  
The Dagstuhl Seminar on "Design and Analysis of Randomized and Approximation Algorithms" (Seminar 11241) was held at Schloss Dagstuhl between June 13-17, 2011.  ...  Many, if not most computational tasks that arise in realistic scenarios are computationally difficult, and no efficient algorithms are known that guarantee an exact (or optimal) solution on every input  ...  In this paper we present an approximation algorithm for the strip packing problem with approximation ratio of 5/3 + for any > 0.  ... 
doi:10.4230/dagrep.1.6.24 dblp:journals/dagstuhl-reports/DyerFFK11 fatcat:lb4xum4yizgo5iwrwau7d5csiy

Track Finding at Belle II [article]

Valerio Bertacchi, Tadeas Bilka, Nils Braun, Giulia Casarosa, Luigi Corona, Sam Cunliffe, Filippo Dattola, Gaetano De Marino, Michael De Nuccio, Giacomo De Pietro, Thanh Van Dong, Giulio Dujany, Patrick Ecker (+43 others)
2020 arXiv   pre-print
The algorithm is designed to balance the requirements of a high efficiency to find charged particles with a good track parameter resolution, a low rate of spurious tracks, and a reasonable demand on CPU  ...  The software is implemented in a flexible, modular manner and employs a diverse selection of global and local track-finding algorithms to achieve an optimal performance.  ...  Furthermore, the inclusion of the subpaths can lead to a recovery of the efficiency loss due to overlapping true tracks.  ... 
arXiv:2003.12466v1 fatcat:jcptnucq3fdatgql5baz2rff7q

SPOQ ℓ_p-Over-ℓ_q Regularization for Sparse Signal Recovery applied to Mass Spectrometry [article]

Afef Cherni, Emilie Chouzenoux, Laurent Duval, Jean-Christophe Pesquet
2020 arXiv   pre-print
However, the latter does not exhibit the desirable property of scale invariance for sparse data.  ...  Extending the SOOT Euclidean/Taxicab ℓ_1-over-ℓ_2 norm-ratio initially introduced for blind deconvolution, we propose SPOQ, a family of smoothed (approximately) scale-invariant penalty functions.  ...  ACKNOWLEDGMENT The authors thank Prof. Audrey Repetti (Heriot-Watt University, UK) for initial motivations and thoughtful discussions, and Prof.  ... 
arXiv:2001.08496v2 fatcat:tqkyhud34rgpvhvcixschcw6au

Sparse PCA through Low-rank Approximations [article]

Dimitris S. Papailiopoulos, Alexandros G. Dimakis, Stavros Korokythakis
2014 arXiv   pre-print
For example, if the eigenvalues of A follow a power-law decay, we obtain a polynomial-time approximation algorithm for any desired accuracy.  ...  We obtain provable approximation guarantees that depend on the spectral decay profile of the matrix: the faster the eigenvalue decay, the better the quality of our approximation.  ...  In (Yuan and Zhang, 2011) , the authors introduced a very efficient sparse PCA approximation based on truncating the well-known power method to obtain the exact level of sparsity desired.  ... 
arXiv:1303.0551v2 fatcat:gcz3vsuchrekrhrzzo5zfcezby

Globally Convergent Numerical Methods for Coefficient Inverse Problems for Imaging Inhomogeneities

Jianguo Xin, Larisa Beilina, Michael Klibanov
2010 Computing in science & engineering (Print)  
While these results are concerned with the first generation of globally convergent algorithms, images obtained by the most recent second generation are also presented for a generic case of imaging of the  ...  How can we differentiate between an underground stone and a land mine? We discuss a class of methods for solving such problems.  ...  By properly choosing the upper limit for pseudo-frequency and with quadratic polynomial approximations of the quantities which depend on the pseudo-frequency, the convexification algorithm is highly efficient  ... 
doi:10.1109/mcse.2010.22 fatcat:jov5xaorlzaj5nxiqhnp3iacke

An FPGA based track finder for the L1 trigger of the CMS experiment at the High Luminosity LHC

R. Aggleton, L.E. Ardila-Perez, F.A. Ball, M.N. Balzer, G. Boudoul, J. Brooke, M. Caselle, L. Calligaris, D. Cieri, E. Clement, S. Dutta, G. Hall (+26 others)
2017 Journal of Instrumentation  
Please cite only the published version using the reference above. Full terms of use are available:  ...  Acknowledgments We are grateful to the CMS collaboration for use of their detector simulation software.  ...  This research work was supported by the Science & Technology Facilities Council (STFC), and the EU FP7-PEOPLE-2012-ITN project nr. 317446, INFIERI, "Intelligent Fast Interconnected and Efficient Devices  ... 
doi:10.1088/1748-0221/12/12/p12019 fatcat:xpsn353cyjh6ppsm7g4dsokrou
« Previous Showing results 1 — 15 out of 2,573 results