Blar i NTNU Open på tittel
Viser treff 6397-6416 av 100943
-
Approved claims for compensation from gynecological patients in Norway?What characterizes the cases? A 14-year nationwide study
(Journal article; Peer reviewed, 2019)Introduction: The Norwegian System of Patient Injury Compensation (NPE) evalu-ates all patient‐reported claims in Norway. Our aim was to study the cases from gy-necological patients approved by NPE in order to identify the ... -
Approximate analysis concerning wave-power absorption by hydrodynamically interacting buoys
(Doktor ingeniøravhandling (Trondheim);234, Doctoral thesis, 1982) -
Approximate Bayesian Inference Based on Expected Evaluations
(Peer reviewed; Journal article, 2023)Approximate Bayesian computing (ABC) and Bayesian Synthetic likelihood (BSL) are two popular families of methods to evaluate the posterior distribution when the likelihood function is not available or tractable. For existing ... -
Approximate Bayesian Inference for Latent Gaussian Models
(Doktoravhandlinger ved NTNU, 1503-8181; 2007:214, Doctoral thesis, 2007)This thesis consists of five papers, presented in chronological order. Their content is summarised in this section. Paper I introduces the approximation tool for latent GMRF models and discusses, in particular, the ... -
Approximate Bayesian inference for spatial econometrics models
(Journal article; Peer reviewed, 2014)In this paper we explore the use of the Integrated Laplace Approximation (INLA) for Bayesian inference in some widely used models in Spatial Econometrics. Bayesian inference often relies on computationally intensive ... -
Approximate Bayesian inference for survival analysis
(Doktoravhandlinger ved NTNU, 1503-8181; 2012:145, Doctoral thesis, 2012) -
Approximate Filtering Approaches for Switching Linear Dynamical Systems
(Master thesis, 2022)«State-observation model» er et dynamisk Bayesiansk nettverk (DBN) som inneholder to mengder stokastiske variabler som utvikler seg over tid; en skjult mengde og en observert mengde. De mest kjente «state-observation» ... -
Approximate marginal inference in binary Markov random fields using a mean squared error energy approximation and the junction tree algorithm
(Master thesis, 2016)In this thesis, we use a mean squared error energy approximation for edge deletion in order to make performing inference in Markov random fields using the junction tree algorithm tractable, and by that develop an approximate ... -
Approximate query processing over static sets and sliding windows
(Journal article; Peer reviewed, 2021)Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and ... -
Approximate recursive algorithm for finding MAP of binary Markov random fields
(Master thesis, 2010)The purpose of this study was to develop a recursive algorithm for computing a maximum a posteriori (MAP) estimate of a binary Markov random field (MRF) by using the MAP-MRF framework. We also discuss how to include an ... -
Approximate recursive calculations of discrete Markov random fields
(Master thesis, 2010)In this thesis we present an approximate recursive algorithm for calculations of discrete Markov random fields defined on graphs. We write the probability distribution of a Markov random field as a function of interaction ... -
Approximate reflection coefficients for a thin VTI layer
(Journal article; Peer reviewed, 2018)We have developed an approximate method to derive simple expressions for the reflection coefficients of P- and SV-waves for a thin transversely isotropic layer with a vertical symmetry axis (VTI) embedded in a homogeneous ... -
Approximate search in misuse detection-based intrusion detection by using the q-gram distance
(Master thesis, 2008)NORSK: Innbruddsdeteksjonssystemer har i de siste årene blitt en ofte brukt og viktig komponent i perimetersikringen for mange organisasjoner. Denne typen systemer bruker ofte en signaturbasert deteksjonsmodell for å ... -
Approximate search with constraints on indels with application in SPAM filtering
(Journal article; Peer reviewed, 2015)Finding distorted occurrences of search pattern(s) in the search string by applying constraints on elementary edit operations (indels (insertions/deletions) and substitutions) is a new category of the approximate string ... -
Approximate String Matching and Filesystem Metadata Carving: A Study of Improving Precision and Recall for Assisting the Digital Forensics Backlog
(Doctoral theses at NTNU;2022:43, Doctoral thesis, 2022)The technical aspects of digital forensics are often dependent upon the progress made in other scientific fields. One such area of study whose results are often applied to digital forensics is string matching theory. String ... -
Approximating a deep reinforcement learning docking agent using linear model trees
(Journal article, 2021)Deep reinforcement learning has led to numerous notable results in robotics. However, deep neural networks (DNNs) are unintuitive, which makes it difficult to understand their predictions and strongly limits their potential ... -
Approximating Global Illumination with Real-Time Ambient Occlusion
(Master thesis, 2019)Å tilnærme global illuminasjon har lenge vært et problem sanntids applikasjoner som spill har prøvd å løse effectivt. I mange år har de beste og mest effektive teknikkene vært omgivende okklusjon algortimer basert i ... -
Approximating Haze in Reflection - Approximate expressions for two-dimensional randomly rough surfaces
(Master thesis, 2015)We give a definition of haze in reflection from two-dimensional surfaces and study this quantity for Gaussian randomly rough surfaces. A simplified model of light scattering, assuming a scalar incident plane wave, the ... -
Approximating linear filters to simulate stochastic aerodynamic models
(Master thesis, 2022)Nåværende metoder for å realisere stokastiske turbulens modeller er avhengige av invers Fourier transformasjonen. Dette gjør det umulig å generere turbulens fortløpende. Som et alternativ foreslår dette prosjektet en metode ... -
Approximation numbers of composition operators on H^p spaces of Dirichlet series
(Journal article; Peer reviewed, 2016)By a theorem of the first named author, $\varphi $ generates a bounded composition operator on the Hardy space ${\mathscr{H}}^p$of Dirichlet series $(1\le p<\infty )$ only if $\varphi (s)=c_0 s+\psi (s)$, where $c_0$ is a ...