Results 231 to 240 of about 354,162 (284)
Fusion of ConvNeXt-Tiny and Swin-Tiny backbones: a comparative analysis for diabetic retinopathy classification. [PDF]
Front Artif IntellParanthaman J, Pichandi S, Mohanty A.
europepmc +1 more source
A method for forensic-ready intrusion detection using explainable learning, prediction-aware graph modeling, and counterfactual analysis. [PDF]
MethodsXGuizani S +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Computers & Operations Research, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
José H. Dulá, Francisco J. López
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
José H. Dulá, Francisco J. López
openaire +3 more sources
2017
In neuroimaging studies, a number of preprocessing steps are often applied to MRI data to correct for artifacts that arise during acquisition. This chapter discusses the main options for arterial spin labeling (ASL) data, along with some of the specific ways in which these can improve the data, but can also interact with subsequent analysis steps.
Michael Chappell +2 more
+4 more sources
In neuroimaging studies, a number of preprocessing steps are often applied to MRI data to correct for artifacts that arise during acquisition. This chapter discusses the main options for arterial spin labeling (ASL) data, along with some of the specific ways in which these can improve the data, but can also interact with subsequent analysis steps.
Michael Chappell +2 more
+4 more sources
2015
For SAT and QBF formulas many techniques are applied in order to reduce/modify the number of variables and clauses of the formula, before the formula is passed to the actual solving algorithm. It is well known that these preprocessing techniques often reduce the computation time of the solver by orders of magnitude.
Ralf Wimmer 0001 +4 more
openaire +2 more sources
For SAT and QBF formulas many techniques are applied in order to reduce/modify the number of variables and clauses of the formula, before the formula is passed to the actual solving algorithm. It is well known that these preprocessing techniques often reduce the computation time of the solver by orders of magnitude.
Ralf Wimmer 0001 +4 more
openaire +2 more sources
2006
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there has been a great deal of recent interest and progress in solving such instances efficiently.
Horst Samulowitz +2 more
openaire +1 more source
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there has been a great deal of recent interest and progress in solving such instances efficiently.
Horst Samulowitz +2 more
openaire +1 more source
Proceedings of the 1974 annual conference on - ACM 74, 1974
Many preprocessor systems exist to transform a program from an augmented language to the particular language expected by a processor. Historically these have been capable of only simple lexical or syntactic substitutions (macro processors). This paper discusses the potential of semantic preprocessing—where the function of a program is “understood” as a
openaire +2 more sources
Many preprocessor systems exist to transform a program from an augmented language to the particular language expected by a processor. Historically these have been capable of only simple lexical or syntactic substitutions (macro processors). This paper discusses the potential of semantic preprocessing—where the function of a program is “understood” as a
openaire +2 more sources
ACM SIGMINI Newsletter, 1978
This paper reports on the implementation of a powerful data manipulation language of a data base system for minicomputers. The technique of language preprocessing is employed.
openaire +1 more source
This paper reports on the implementation of a powerful data manipulation language of a data base system for minicomputers. The technique of language preprocessing is employed.
openaire +1 more source
Laconic Cryptography with Preprocessing
Laconic cryptography focuses on designing two-message protocols that allow secure computation over large datasets while minimizing communication costs. While laconic cryptography protocols achieve asymptotically optimal communication complexity for many tasks, their concrete efficiency is prohibitively expensive, due to heavy use of public-key ...Döttling, Nico +3 more
openaire +4 more sources