Results 61 to 70 of about 1,005,063 (328)
Algorithms for Simultaneous Padé Approximations [PDF]
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016 ISSAC ...
Nielsen, Johan S. R., Storjohann, Arne
openaire +2 more sources
Molecular Oncology, EarlyView.Generation of two normal and tumour (cancerous) paired human cell lines using an established tissue culture technique and their characterisation is described. Cell lines were characterised at cellular, protein, chromosome and gene expression levels and for HPV status.
Simon Broad +12 more
wiley +1 more source
Upper and lower solution method for control of second-order Kolmogorov type systems
Journal of Numerical Analysis and Approximation TheoryIn this paper, an upper and lower solution method for the control of second-order Kolmogorov systems is introduced. Two iterative algorithms, one exact and one approximate, are proposed and their convergence is studied. The technique is based on Perov's
Alexandru Hofman
doaj +1 more source
Adaptive variational discretization approximation method for parabolic optimal control problems
Journal of Inequalities and Applications, 2020 In this paper, we study variational discretization method for parabolic optimization problems. Firstly, we obtain some convergence and superconvergence analysis results of the approximation scheme.
Yuelong Tang, Yuchun Hua
doaj +1 more source
Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 In this paper, we consider the problem of scheduling independent parallel tasks in parallel systems with identical processors. The problem is NP-hard, since it includes the bin packing problem as a special case when all tasks have unit execution time. We
Keqin Li
doaj +1 more source
Approximating the MaxCover Problem with Bounded Frequencies in FPT Time [PDF]
, 2013 We study approximation algorithms for several variants of the MaxCover problem, with the focus on algorithms that run in FPT time. In the MaxCover problem we are given a set N of elements, a family S of subsets of N, and an integer K. The goal is to find
Faliszewski, Piotr, Skowron, Piotr
core
A randomized approximate nearest neighbors algorithm [PDF]
Applied and Computational Harmonic Analysis, 2011 We present a randomized algorithm for the approximate nearest neighbor problem in d -dimensional Euclidean space. Given N points { x j } in , the ...
Peter Wilcox, Jones +2 more
openaire +2 more sources
Molecular Oncology, EarlyView.We developed and validated a DNA methylation–based biomarker panel to distinguish pleural mesothelioma from other pleural conditions. Using the IMPRESS technology, we translated this panel into a clinically applicable assay. The resulting two classifier models demonstrated excellent performance, achieving high AUC values and strong diagnostic accuracy.
Janah Vandenhoeck +12 more
wiley +1 more source
Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems [PDF]
, 2012 We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the fixed-
Magnanti, Thomas L., Stratila, Dan
core +2 more sources
Next‐generation proteomics improves lung cancer risk prediction
Molecular Oncology, EarlyView.This is one of very few studies that used prediagnostic blood samples from participants of two large population‐based cohorts. We identified, evaluated, and validated an innovative protein marker model that outperformed an established risk prediction model and criteria employed by low‐dose computed tomography in lung cancer screening trials.
Megha Bhardwaj +4 more
wiley +1 more source