Blar i Department of Informatics på tittel
Viser treff 255-274 av 543
-
Largest chordal and interval subgraphs faster than 2n
(Peer reviewed; Journal article, 2015-08-22)We prove that in a graph with n vertices, induced chordal and interval subgraphs with the maximum number of vertices can be found in time O(2λn) for some λ< 1. These are the first algorithms breaking the trivial 2nnO(1) ... -
Learning Description Logic Ontologies: Five Approaches. Where Do They Stand?
(Journal article; Peer reviewed, 2020)The quest for acquiring a formal representation of the knowledge of a domain of interest has attracted researchers with various backgrounds into a diverse field called ontology learning. We highlight classical machine ... -
Lex M versus MCS-M
(Journal article, 2006) -
Linear dependencies between non-uniform distributions in DES
(Master thesis, 2014-05-30)Davies and Murphy explained some non-uniform distributions of the output from pairs and triplets of S-boxes in DES, and how they are completely dependent on some key bits. There are linear dependencies between these ... -
Lineær kompleksitet til produkter av maksimalsekvenser
(Master thesis, 2000) -
Localizing Cell Towers from Crowdsourced Measurements
(Master thesis, 2015-06-01)Today, several internet sites exist that aim to provide the locations and number of cellular network antennas worldwide. For example [1],[2] and [3]. What makes this task difficult to accomplish is the lack of information ... -
Looking at the Stars
(2006-02-28) -
Lower bounds on the size of spheres of permutations under the Chebychev distance
(Peer reviewed; Journal article, 2010)Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |pi − i| ≤ d for all i are given -
Machine Learning methods for mood disorder decision support
(Master thesis, 2017-07-11) -
The male germ cell gene regulator CTCFL is functionally different from CTCF and binds CTCF-like consensus sites in a nucleosome composition-dependent manner
(Peer reviewed; Journal article, 2012-06-18)Background: CTCF is a highly conserved and essential zinc finger protein expressed in virtually all cell types. In conjunction with cohesin, it organizes chromatin into loops, thereby regulating gene expression and epigenetic ... -
Managing spatial selections with contextual snapshots
(Peer reviewed; Journal article, 2014-12)Spatial selections are a ubiquitous concept in visualization. By localizing particular features, they can be analysed and compared in different views. However, the semantics of such selections often depend on specific ... -
MassAnalyzer, a program to help find labeled peptides and compare them to their unlabeled counterparts in a SILAC experiment
(Master thesis, 2008-11-27)Mass spectrometry(MS) have become an increasingly popular analysis method for high throughput experiments on proteins in biology. SILAC(stable isotope labeling by amino acids in cell culture) is a method within MS that ... -
MassSorter: a tool for administrating and analyzing data from mass spectrometry experiments on proteins with known amino acid sequences
(Peer reviewed; Journal article, 2006-01-26)Background: Proteomics is the study of the proteome, and is critical to the understanding of cellular processes. Two central and related tasks of proteomics are protein identification and protein characterization. Many ... -
Mathematical modelling of nitric oxide/cyclic GMP/cyclic AMP signalling in platelets
(Peer reviewed; Journal article, 2018-02-19)Platelet activation contributes to normal haemostasis but also to pathologic conditions like stroke and cardiac infarction. Signalling by cGMP and cAMP inhibit platelet activation and are therefore attractive targets for ... -
A matrix-free method for regularisation with unrestricted variables
(Master thesis, 2008)In this thesis a method for the partially norm constrained least squares problem is presented. The method relies on a large-scale trust-region solver and has a low storage requirement. A combination of image misalignment ... -
Maximum matching width: New characterizations and a fast algorithm for dominating set
(Conference object; Peer reviewed; Journal article, 2015)We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) <= k if and only if it is a subgraph of a chordal graph H and for every maximal clique X of H there exists A,B,C \subseteq X with A ... -
Maximum number of edges in graph classes under degree and matching constraints
(Master thesis, 2015-05-12)In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has to satisfy certain constraints. In this thesis, we ask how many edges a graph can have with restrictions on its degree ... -
Maximum number of objects in graph classes.
(Master thesis, 2015-05-31)The focus of this thesis is the study and implementation of two exact exponential time algorihms. These algorihms finds and lists the number of minimal dominating sets and the number of minimal subset feedback vertex sets ... -
MedUse: A Visual Analysis Tool for Medication Use Data in the ABCD Study
(Peer reviewed; Journal article, 2019)The RxNorm vocabulary is a yearly-published biomedical resource providing normalized names for medications. It is used to capture medication use in the Adolescent Brain Cognitive Development (ABCD) study, an active and ... -
Memento: Localized time‐warping for spatio‐temporal selection
(Peer reviewed; Journal article, 2020)Interaction techniques for temporal data are often focused on affecting the spatial aspects of the data, for instance through the use of transfer functions, camera navigation or clipping planes. However, the temporal aspect ...