Blar i Department of Informatics på tittel
Viser treff 1104-1123 av 1199
-
Towards Reusable GUI Structures
(Chapter, 2023)Graphical user interfaces present data as structures (lists, trees, grids). Convenient features to manipulate these structures are tedious to implement. We are working towards a GUI programming approach, where concise ... -
Towards stronger Lagrangean bounds for stable spanning trees
(Chapter, 2022)Given a graph G=(V,E) and a set C of unordered pairs of edges regarded as being in conflict, a stable spanning tree in G is a set of edges T inducing a spanning tree in G, such that for each {e_i, e_j} in C, at most one ... -
Transformations for Array programming
(Master thesis, 2020-05-15) -
Transversals of longest paths
(Journal article; Peer reviewed, 2020-03)Let lpt(G) be the minimum cardinality of a transversal of longest paths in G, that is, a set of vertices that intersects all longest paths in a graph G. There are several results in the literature bounding the value of ... -
Trådløse applikasjoner til hjelp for synshemmede
(Master thesis, 2008)Det eksisterer fremdeles grupper i dagens teknologiske samfunn som trenger hjelpemidler for å utføre dagligdagse oppgaver. Det er fremdeles enkelte i dagens teknologiske samfunn som trenger hjelpemidler for å utføre ... -
Treewidth is NP-Complete on Cubic Graphs
(Journal article; Peer reviewed, 2023)In this paper, we show that Treewidth is NP-complete for cubic graphs, thereby improving the result by Bodlaender and Thilikos from 1997 that Treewidth is NP-complete on graphs with maximum degree at most 9. We add a new ... -
Trends & Opportunities in Visualization for Physiology: A Multiscale Overview
(Journal article; Peer reviewed, 2022)Combining elements of biology, chemistry, physics, and medicine, the science of human physiology is complex and multifaceted. In this report, we offer a broad and multiscale perspective on key developments and challenges ... -
Triplicate functions
(Journal article; Peer reviewed, 2022)We define the class of triplicate functions as a generalization of 3-to-1 functions over \(\mathbb {F}_{2^{n}}\) for even values of n. We investigate the properties and behavior of triplicate functions, and of 3-to-1 among ... -
TRUST NO ONE; Homomorphic Encryption and its Applications
(Master thesis, 2023-02-02) -
Turán's Theorem Through Algorithmic Lens
(Journal article; Peer reviewed, 2023) -
Twinning-by-Construction: Ensuring Correctness for Self-adaptive Digital Twins
(Journal article; Peer reviewed, 2022)Digital twin applications use digital artefacts to twin physical systems. The purpose is to continuously mirror the structure and behavior of the physical system, such that users can analyse the physical system by means ... -
Two new algorithms for error support recovery of low rank parity check codes
(Journal article; Peer reviewed, 2023)Due to their weak algebraic structure, low rank parity check (LRPC) codes have been employed in several post-quantum cryptographic schemes. In this paper we propose new improved decoding algorithms for [n, k]qm LRPC codes ... -
Two New Families of Quadratic APN Functions
(Journal article; Peer reviewed, 2022) -
Two-tensor Fiber Tractography
(Peer reviewed; Chapter, 2007)Estimating white matter fiber pathways from a diffusion tensor MRI dataset has many important applications in medical research. However, the standard approach of performing tracking on single-tensor estimates per voxel is ... -
A type system for counting instances of software components
(Peer reviewed; Journal article, 2012)We identify an abstract language for component software based on process algebra. Besides the usual operators for sequential, alternative and parallel composition, it has primitives for instantiating components and for ... -
A Type System for the Safe Instantiation of Components
(Journal article; Peer reviewed, 2004)Component composition can lead to multiple instances of the same component. Some components can have only one instance loaded at a time, for example, when a unique external resource is used. We give an abstract component ... -
A Type System for Usage of Software Components
(Lecture Notes in Computer Science, Chapter; Peer reviewed, 2009)The aim of this article is to support component-based software engineering by modelling exclusive and inclusive usage of software components. Truong and Bezem describe in several papers abstract languages for component ... -
Type Systems for Guaranteeing Resource Bounds of Component Software
(Doctoral thesis, 2006-05-15)Since the early days of the development of programming languages, people have been developing various methods to reduce the runtime errors of software programs. These methods range from static analysis, testing to runtime ... -
Type Systems for Resource Use in Component Software
(Master thesis, 2006)In many situations a programmer must be concerned with resources which are not accounted and controlled completely by the programming language. These could be external physical resources, like a printer or a screen, it ... -
Type theoretical databases
(Journal article; Peer reviewed, 2020)We show how the display-map category of finite (symmetric) simplicial complexes can be seen as representing the totality of database schemas and instances in a single mathematical structure. We give a sound interpretation ...