Filters








81,539 Hits in 7.9 sec

Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations [article]

Wenjun Li, Huan Peng, Yongjie Yang
2022 arXiv   pre-print
Based on some refined observations, we propose a kernel of O(k^3) vertices and O(k^4) edges, significantly improving the previous kernel of O(k^12) vertices and O(k^24) edges.  ...  In addition, we derive an O^*(3.792^k)-time algorithm for the claw, diamond-free edge deletion problem.  ...  Based on refined observations, we derive branching rules leading to an improved algorithm of worst-case running time O * (3.792 k ). The first branching rule is on induced claws.  ... 
arXiv:1707.06779v3 fatcat:swu5je2vjrahdf42f4hnitarbe

Accurate Analysis of Quality Properties of Software with Observation-Based Markov Chain Refinement

Colin Paterson, Radu Calinescu
2017 2017 IEEE International Conference on Software Architecture (ICSA)  
Our new method addresses this gap by refining the high-level CTMC model of a component-based software system based on observations of the execution times of its components.  ...  Existing research focuses on improving the efficiency of CTMC analysis and on identifying new applications for this analysis.  ...  We introduce an observation-based Markov chain refinement (OMNI) method that significantly improves the accuracy with which quality software properties can be analysed.  ... 
doi:10.1109/icsa.2017.14 dblp:conf/icsa/PatersonC17 fatcat:orpqihysebehpcruriitnunkoq

The generalized Fermat equation with exponents 2, 3, n [article]

Nuno Freitas, Bartosz Naskrecki, Michael Stoll
2019 arXiv   pre-print
Using these criteria we produce the minimal list of twists of X(p) that have to be considered, based on local information at 2 and 3; this list depends on p 24.  ...  We also give some partial results for the case p = 13.  ...  We thank David Zureick-Brown for sharing his notes with us. We also thank Jean-Pierre Serre for pointing us to Ligozat's work on the splitting of J(11).  ... 
arXiv:1703.05058v3 fatcat:dpclv3wrufbvxiwrhppj6uezue

An O^*(1.0821^n)-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3 [article]

Davis Issac, Ragesh Jaiswal
2015 arXiv   pre-print
We give an O^*(1.0821^n)-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3.  ...  This improves all the previous running time bounds known for the problem.  ...  Given the above basic idea regarding computing the running time, our algorithm is based on the observation that if there were no small cycles in the graph, there exists a simple branch that causes a very  ... 
arXiv:1308.1351v3 fatcat:nug3jkjfozfqbiznrclewob2k4

"Push-the-Error" Algorithm for Nonlinear n-Term Approximation

W. Dahmen, P. Petrushev
2005 Constructive approximation  
This allows one to show that the improved scheme captures all rates of best n-term approximation. 261 262 W. Dahmen and P. Petrushev "Push-the-Error" Algorithm for Nonlinear n-Term Approximation 263  ...  This paper is concerned with further developing and refining the analysis of a recent algorithmic paradigm for nonlinear approximation, termed the "Push-the-Error" scheme.  ...  This enables us to show that the improved algorithm captures all rates of the best n-term approximation.  ... 
doi:10.1007/s00365-005-0607-8 fatcat:hkufqbepizfutdxpy25hfpernm

Progress in nuclear magnetic resonance spectroscopy

B. N
1973 Journal of Molecular Structure  
We thank the following colleagues for helpful discussions, which greatly improved this article: Marcelo Berardi, Vincent Chen, David Cowburn, Brian Hare, Terry Oas, Tomás Lozano-Pérez, Art Palmer, Len  ...  We thank all members of the Donald laboratory, past and present, for helpful discussions and comments. We thank the Duke University NMR Center for their assistance and support.  ...  Several algorithms have been proposed for structure-based assignment using RDCs [4, 3, 63, 82, 83, 79, 67, 64] .  ... 
doi:10.1016/0022-2860(73)80027-4 fatcat:bx6uuudlnvevjc66o6sgp4pizu

Re-ranking Permutation-Based Candidate Sets with the n-Simplex Projection [chapter]

Giuseppe Amato, Edgar Chávez, Richard Connor, Fabrizio Falchi, Claudio Gennaro, Lucia Vadicamo
2018 Lecture Notes in Computer Science  
We propose a refining approach based on a metric embedding, called n-Simplex projection, that can be used on metric spaces meeting the n-point property.  ...  We propose to reuse the distances computed for building the data permutations to derive these bounds and we show how to use them to improve the permutation-based results.  ...  For reference, we Re-ranking Permutation-Based Candidate Sets with the n-Simplex proj.  ... 
doi:10.1007/978-3-030-02224-2_1 fatcat:kuyhrkzlrzeznlutpkss3px7ji

Distances and metallicities for 17 Local Group galaxies

A. W. McConnachie, M. J. Irwin, A. M. N. Ferguson, R. A. Ibata, G. F. Lewis, N. Tanvir
2005 Monthly notices of the Royal Astronomical Society  
The observations for each of the dwarf galaxies were intentionally taken in photometric conditions.  ...  The majority of these galaxies are members of the M31 subgroup and the observations are deep enough to study the top few magnitudes of the red giant branch in each system.  ...  One obvious candidate is based on the Tip of the Red Giant Branch (TRGB).  ... 
doi:10.1111/j.1365-2966.2004.08514.x fatcat:6kot4jozoneozo57szah3en67m

Coupling XFEM and Peridynamics for brittle fracture simulation: part II—adaptive relocation strategy

Ilias N. Giannakeas, Theodosios K. Papathanasiou, Arash S. Fallah, Hamid Bahai
2020 Computational Mechanics  
An adaptive relocation strategy for a coupled XFEM-Peridynamic (PD) model is introduced.  ...  To improve the computational efficiency of the coupled model during fracture, a trigger is introduced that is based on the relative displacement between two FE nodes.  ...  Based on their results, crack branching takes place between t = 20.50 ∼ 21.50 μs and is located approximately at x = 6.80 μm .  ... 
doi:10.1007/s00466-020-01872-8 fatcat:qnxot2bzbrgz5e5zxs22wvasfe

Glycan-Protein Interactions Determine Kinetics of N-Glycan Remodeling

Corina Mathew, Gregor Weiß, Christoph Giese, Chia-wei Lin, Marie-Estelle Losfeld, Rudi Glockshuber, Sereina Riniker, Markus Aebi
2021 RSC Chemical Biology  
glycostructures on mature...  ...  A hallmark of N-linked glycosylation in the secretory compartments of eukaryotic cells is the sequential remodeling of an initially uniform oligosaccharide to a site-specific, heterogeneous ensemble of  ...  We thank Tsjerk Wassenaar for providing the source code for the near-densest lattice packing algorithm and the corresponding rotational motion removal in GROMACS 2018.  ... 
doi:10.1039/d1cb00019e fatcat:nyky443dffdv3air5m52pzukiq

Generalized local branching heuristics and the capacitated ring tree problem

Alessandro Hill, Stefan Voß
2018 Discrete Applied Mathematics  
Our implementation operates on top of an efficient branch & cut algorithm for the CRTP. The sets of refinement variables are deduced from single and multi-ball CRTP-tailored network node clusters.  ...  In this paper we present a heuristic framework that is based on mathematical programming to solve network design problems. Our techniques combine local branching with locally exact refinements.  ...  Using this concept we designed a heuristic for the CRTP based on an exact branch & cut algorithm.  ... 
doi:10.1016/j.dam.2017.09.010 fatcat:5kshgxgblvhp3cqswun4tzqvzq

Model-based and model-free filtering of genomic data

M. N. Nounou, H. N. Nounou, M. Mansouri
2013 Network Modeling Analysis in Health Informatics and Bioinformatics  
The results show clear advantages for the model-based over the model-free filtering techniques, and that the PF outperforms other modelbased methods.  ...  From a biological perspective, the model-based and online model-free filtering techniques can be used when filtering is needed online, such as within an intervention framework to cure diseases, while the  ...  Based on this unscented transformation, the unscented Kalman filtering algorithm can be summarized as shown in Algorithm 2.  ... 
doi:10.1007/s13721-013-0030-1 dblp:journals/netmahib/NounouNM13 fatcat:444ac6xhnngxng3wznaiidmd6u

A Cluster-based Evolutionary Algorithm for the Single Machine Total Weighted Tardiness-scheduling Problem

Istv�n Borgulya
2002 Journal of Computing and Information Technology  
In the first stage it approaches some locally optimal solutions by grouping based on similarity.  ...  The algorithm managed to find, within an acceptable time limit, the best-known solution for the problems, or found solutions within 1% of the best-known solutions in 99 % of the tasks.  ...  We concluded that an initial number of clusters of 10 (t = 10) and a broadening at every 5000 iterations (m = 5000) was observed to be optimal on the benchmark sets.  ... 
doi:10.2498/cit.2002.03.09 fatcat:k63ok2rdhrekhnpdry4bx5aupa

Classification Similarity Network Model for Image Fusion Using Resnet50 and GoogLeNet

P. Siva Satya Sreedhar, N. Nandhagopal
2022 Intelligent Automation and Soft Computing  
The current trend in Image Fusion (IF) algorithms concentrate on the fusion process alone.  ...  The suggested model shows a significant improvement than the modern IF algorithms.  ...  Ashok Reddy for their contribution. Funding Statement: The authors received no specific funding for this study.  ... 
doi:10.32604/iasc.2022.020918 fatcat:vzzmqm4i4nckflgko2byzo7bie

Exact Algorithms for Maximum Independent Set [chapter]

Fabrizio Grandoni
2015 Encyclopedia of Algorithms  
The (open) neighborhood of a vertex v is N (v) = {u ∈ V : uv ∈ E}, and its closed neighborhood is N Key Results A very simple algorithm solves MIS (exactly) in O * (2 n ) time: it is sufficient to enumerate  ...  The Maximum Independent Set problem (MIS) asks to determine the maximum cardinality α(G) of an independent set of G. MIS is one of the best studied NP-hard problems.  ...  Refined Branching Rules Several refined branching rules have been developed for MIS.  ... 
doi:10.1007/978-3-642-27848-8_514-1 fatcat:to7uxehxorb7xdebvs7mr2ofqm
« Previous Showing results 1 — 15 out of 81,539 results