A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Feasibility of Radiomics to Differentiate Coronavirus Disease 2019 (COVID-19) from H1N1 Influenza Pneumonia on Chest Computed Tomography: A Proof of Concept
2021
Preserved Fulltext
Multiple radiomics features were extracted from the lesions and used to develop support-vector machine (SVM), k-nearest neighbor (k-NN), decision tree, neural network, adaptive boosting (AdaBoost), and ...
This study was conducted to test the ability of radiomics-artificial intelligence (AI) to perform this task. ...
The basic concept behind radiomics is the ability of computers and software to detect many more radiology features from medical images. ...
doi:10.30476/ijms.2021.88036.1858
pmid:34840382
pmcid:PMC8611216
fatcat:ce2j4hxvffdl5e3y5incfl2f5u
Feasible Iteration of Feasible Learning Functionals
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We are also grateful to anonymous referees for many helpful suggestions. ...
One such referee provided hints about the truth and truth and proof, respectively, of what became, then, Lemmas 6 and 7; hence, these results are joint work with that referee. ...
Additionally we require (f) + S is feasibly computable, (g) · S is feasibly computable, (h) from any natural number n, a notation n S for n is feasibly computable and (i) l S , n S are feasibly computable ...
doi:10.1007/978-3-540-75225-7_7
fatcat:g3wkw2lsq5doxljcprvlb7lxeq
ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS
2012
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A program is called feasible if all values it computes are polynomially bounded in terms of the input. ...
We investigate the decidability of the feasibility problem for imperative programs with bounded loops. ...
Proof. We reduce from the feasibility problem for L ≤ [Y, Y+Z, 0]. ...
doi:10.1142/s0129054112400588
fatcat:gfesh5rznbfopk27f2qjspglei
A note on polynomial solvability of the CDT problem
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In Section 2.3 we show how to refine our algorithm from Section 2.1 so as to produce an ε-feasible vector in the case that infeasibility is not proved. ...
,z n ) T , which is ρ/2-feasible for Z k , and such that |z k − max{P k,k , −M k,k }| ≤ ρ/2. The result follows from the rounding step used to obtainx k in Step 2. ...
arXiv:1406.6429v6
fatcat:u6aq5dkb7namppzkgtlpalbxbu
A Note on Polynomial Solvability of the CDT Problem
2016
SIAM Journal on Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
) under the bit model of computing. ...
In this paper we show how to adapt a construction of Barvinok so as to obtain a polynomial-time algorithm for quadratic programming with a fixed number of quadratic constraints (one of which is ellipsoidal ...
In Section 2.3 we show how to refine our algorithm from Section 2.1 so as to produce an ε-feasible vector in the case that infeasibility is not proved. ...
doi:10.1137/15m1009871
fatcat:j5w5wtqgojeydkxqarfv6zakg4
Page 278 of Naval Research Logistics Vol. 4, Issue 4
[page]
1957
Naval Research Logistics
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Algorithm 2:
(a) Compute an optimal solution for Problem II. If this plan is feasible for Problem III, it is optimal, and the problem is solved; if not, proceed to (b). ...
Proof of this theorem follows much the same arguments as Theorem 4, and therefore is omitted. It forms the basis for the computational procedure given below for Problem II. ...
Simultaneous area and delay minimum K-LUT mapping for K-exact networks
1996
Integration
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
This leads to a polynomial time algorithm for computing the simultaneous area and delay minimum mapping for such networks using K-input lookup tables. ...
We then show that for K = 2 the mapping solution for a a-bounded network, minimizing the area and delay simultaneously, can be easily obtained from that of a a-exact network derived from it by eliminating ...
'7 Acknowledgments The authors would like to thank Eugene Ding and Jason Cong for suggesting ways to simplify the presentation of the proofs in this paper and for observing that the simultaneous area and ...
doi:10.1016/0167-9260(96)00004-1
fatcat:zt2njmxdzvge7fwqfwhral5rli
WHY STEM?
2019
№1(41) (2017)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
andmathematics into a single STEM complex a fashionable tendency, as someeducators think or is there a deep reason behind this combination In thispaper, we show that the latest developments in Theory of Computation ...
The authors are thankful to Dr. Mourat Tchoshanov for his encouragement and valuable discussions. ...
Once a proof is presented, it is feasible to check it -of course, this requires it to be a full proof, not a sketch filled with statements "it is not that difficult to prove that". ...
doi:10.25513/2222-8772.2019.2.99-106
fatcat:vjimpeaa6fbvfgl6vatodzg3s4
Some applications of logic to feasibility in higher types
2004
ACM Transactions on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In particular we provide an example how one can extract feasible programs from mathematical proofs which use non-feasible functions. ...
on how to extend this notion on functionals, i.e., what functionals should be considered feasible. ...
The difficult part is to prove that if a functional is polynomial time computable or computable from basic feasible functionals using polynomially bounded recursion of polynomial length, that then it is ...
doi:10.1145/976706.976713
fatcat:wqdkefhs7jfptnn7wic7uys7ae
Enhancing /spl epsiv/-approximation algorithms with the optimal linear scaling factor
2006
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In this paper, having observed that the computational complexities of the "-approximation algorithms using the linear scaling technique are linearly proportional to the linear scaling factor, we investigate ...
the issue of finding the optimal (the smallest) linear scaling factor to reduce the computational complexities, and propose two algorithms, the optimal linear scaling algorithm (OLSA) and the transformed ...
Proof: Assume is the optimal feasible path of is the optimal feasible path in , and is the cost of in . ...
doi:10.1109/tcomm.2006.878832
fatcat:rl5wonolxngzbjan5hodoljftq
Page 4943 of Mathematical Reviews Vol. , Issue 94i
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Logic from computer science (Berkeley, CA, 1989), 295-317, Math. Sci. Res. Inst. Publ., 21, Springer, New York, 1992. ...
“When restricted to proofs with universal or existential cuts, this problem is shown to be (1) undecidable for linear or tree-like LK-proofs (corresponding to the undecidability of second-order unification ...
Page 3651 of Mathematical Reviews Vol. , Issue 94g
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This follows from a circuit-size lower bound due to M. L. Minsky and L. Papert [Perceptrons: an introduction to computational geometry, MIT Press, Cambridge, MA, 1969]. R. ...
The formulas from a pa- per by A. I. F. Urquhart [J. Assoc. Comput. Mach. 34 (1987), no. 1, 209-219; MR 89e:68056] have only superpolynomially long proofs in the system. ...
On extracting computations from propositional proofs (a survey)
2010
Foundations of Software Technology and Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of functions associated with ...
Such bounds can potentially be used to prove (conditional or unconditional) lower bounds on the lengths of proofs of these tautologies and show separations of some weak proof systems. ...
Acknowledgment I would like to thank to Jan Krajíček and Neil Thapen for their comments on the draft of this paper. ...
doi:10.4230/lipics.fsttcs.2010.30
dblp:conf/fsttcs/Pudlak10
fatcat:ry32vlylvndybmou7upwnxsnte
SOLVING QUADRATIC PROGRAMS BY AN EXACT PENALTY FUNCTION11This work is supported in part by the National Science Foundation under Grant ENG 79-03881 and also by the United States Army under Contract No. DAAG29-75-C-0024
[chapter]
1981
Nonlinear Programming 4
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
To maintain feasibility, we need a starting feasible point, which is usually computed by a linear programming tech-* nique. ...
By so doing, we can avoid the expense of computating a starting feasible point. ...
doi:10.1016/b978-0-12-468662-5.50007-0
fatcat:i33sdyxvdbanfaya4ibq3lxk4y
Bounded arithmetic, proof complexity and two papers of Parikh
1999
Annals of Pure and Applied Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. ...
We discuss in depth two of Parikh's papers on these subjects and some of the subsequent progress in the areas of feasible arithmetic and lengths of proofs. ...
time to compute. ...
doi:10.1016/s0168-0072(98)00030-x
fatcat:7etzlilxmrau3bsjceekfwms5y
« Previous
Showing results 1 — 15 out of 353,928 results