Now showing items 31-40 of 366
New Results on Minimal Triangulations
(The University of Bergen, 2006-04-25)
Looking at the Stars
Vekthierarkiet for nokre kodeklassar
(The University of Bergen, 1995)
A polynomial-time algorithm for LO based on generalized logarithmic barrier functions
(Academic Publications, 2008)
Self-stabilizing algorithms for the distance-k coloring problem
(The University of Bergen, 2008-11-10)
Many problems of practical interest can be modeled as coloring problems. For example, when you are making a phone call using a mobile phone, it needs to transform the voice signal into an electronic wireless signal. Eachsuch ...
Throughput and robustness of bioinformatics pipelines for genome-scale data analysis
(The University of Bergen, 2014-02-19)
The post-genomic era has been heavily influenced by the rapid development of highthroughput molecular-screening technologies, which has enabled genome-wide analysis approaches on an unprecedented scale. The constantly ...
A geometry-based generic predictor for catalytic and allosteric sites
(Oxford University Press, 2011)
An important aspect of understanding protein allostery, and of artificial effector design, is the characterization and prediction of substrate- and effector-binding sites. To find binding sites in allosteric enzymes, many ...
En visuell tilnærming til simulering av købaserte modeller i Java
(The University of Bergen, 2004)
Managing spatial selections with contextual snapshots
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 ...
Practical Aspects of the Graph Parameter Boolean-width
(The University of Bergen, 2014-08-18)