Now showing items 164-183 of 378

• #### Interactive Visual Analysis of Time-dependent Flows: Physics- and Statistics-based Semantics ﻿

(The University of Bergen, 2012-06-22)
With the increasing use of numerical simulations in the fluid mechanics community in recent years flow visualization increasingly gains importance as an advanced analysis tool for the simulation output. Up to now, ...
Doctoral thesis
• #### Interactive Visualization of Streaming Data with Kernel Density Estimation ﻿

(IEEE, 2011)
In this paper, we discuss the extension and integration of the statistical concept of Kernel Density Estimation (KDE) in a scatterplotlike visualization for dynamic data at interactive rates. We present a line kernel ...
Conference object
• #### Interactively illustrating polymerization using three-level model fusion ﻿

(BioMed Central, 2014-10-14)
Background: Research in cell biology is steadily contributing new knowledge about many aspects of physiological processes, both with respect to the involved molecular structures as well as their related function. Illustrations ...
Journal article
• #### Interaksjon og Søk i Dynamic Presentation Generator ﻿

(The University of Bergen, 2010-06)
Denne oppgaven handler om hvordan interaksjon og søk kan integreres i Dynamic Presentation Generator. Dette innholdshåndteringssystemet benytter seg av presentasjonsmønstre, en ide som går ut på å skille struktur og innhold. ...
Master thesis
• #### Interaktive bridgetjenester for Internett og Mobil ﻿

(The University of Bergen, 2008)
Denne rapporten presenterer utviklingen av to forskjellige systemer til bruk i forbindelse med kortspillet bridge. Det første systemet er et web-basert administrasjonssystem for bridge-turneringer, mens det andre systemet ...
Master thesis
• #### Interfacing concepts: Why declaration style shouldn't matter ﻿

(Elsevier, 2010-09-17)
A concept (or signature) describes the interface of a set of abstract types by listing the operations that should be supported for those types. When implementing a generic operation, such as sorting, we may then specify ...
Journal article
• #### Investigating Streamless Sets ﻿

(Dagstuhl Publishing, 2015)
In this paper we look at streamless sets, recently investigated by Coquand and Spiwack. A set is streamless if every stream over that set contain a duplicate. It is an open question in constructive mathematics whether the ...
Conference object
• #### Investigating the Limitations of Java Annotations for Input Validation ﻿

(2010)
Recently Java annotations have received a lot of attention as a possible way to simplify the usage of various frameworks, ranging from persistence and verification to security. In this paper we discuss our experiences ...
Conference object
• #### J2ME Bluetooth programming ﻿

(The University of Bergen, 2004)
Master thesis
• #### JASPAR 2014: An extensively expanded and updated open-access database of transcription factor binding profiles ﻿

(Oxford University Press, 2014-01)
JASPAR (http://jaspar.genereg.net) is the largest open-access database of matrix-based nucleotide profiles describing the binding preference of transcription factors from multiple species. The fifth major release greatly ...
Journal article
• #### K-packing and K-domination on tree graphs ﻿

(The University of Bergen, 2004)
Master thesis
• #### Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves ﻿

(Dagstuhl Publishing, 2009)
The {\sc $k$-Leaf Out-Branching} problem is to find an out-branching, that is a rooted oriented spanning tree, with at least $k$ leaves in a given digraph. The problem has recently received much attention from the viewpoint ...
Conference object
• #### Kernelization of Vertex Cover by Structural Parameters ﻿

(The University of Bergen, 2015-08-03)
In the NP-complete problem Vertex Cover, one is given a graph G and an integer k and are asked whether there exists a vertex set S ⊆ V (G) with size at most k such that every edge of the graph is incident to a vertex in ...
Master thesis
• #### Largest chordal and interval subgraphs faster than 2n ﻿

(Springer, 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) ...
Journal article
• #### Lex M versus MCS-M ﻿

(Elsevier, 2006)
Journal article
• #### Linear dependencies between non-uniform distributions in DES ﻿

(The University of Bergen, 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 ...
Master thesis
• #### Lineær kompleksitet til produkter av maksimalsekvenser ﻿

(The University of Bergen, 2000)
Master thesis
• #### Localizing Cell Towers from Crowdsourced Measurements ﻿

(The University of Bergen, 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 ...
Master thesis
• #### Looking at the Stars ﻿

(Elsevier, 2006-02-28)
• #### Lower bounds on the size of spheres of permutations under the Chebychev distance ﻿

(Springer, 2010)
Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |pi − i| ≤ d for all i are given
Peer reviewedJournal article