Now showing items 702-721 of 773

    • Towards Advanced Interactive Visualization for Virtual Atlases 

      Smit, Noeska Natasja; Bruckner, Stefan (Advances in Experimental Medicine and Biology, Chapter; Peer reviewed, 2019)
      An atlas is generally defined as a bound collection of tables, charts or illustrations describing a phenomenon. In an anatomical atlas for example, a collection of representative illustrations and text describes anatomy ...
    • (Towards an) Implementation of a Graphical Editor for Diagrammatic Predicate Logic in the Eclipse Platform 

      Skjerveggen, Stian (Master thesis, 2008)
      The primary goal of this master's thesis is to explore how the Eclipse Platform can be beneficial for the Generic Diagrammatic Software Specification project, and how a graphical editor in the Eclipse Platform can be put ...
    • Towards Correct Modelling and Model Transformation in DPF 

      Wang, Xiaoliang (Doctoral thesis, 2016-06-14)
      Model-driven engineering (MDE) is a model-centric software development methodology. It promotes models as first-class entities in software de- velopment. Models are used to represent software along software devel- opment ...
    • Towards Efficient Algorithms in Algebraic Cryptanalysis 

      Schilling, Thorsten Ernst (Doctoral thesis, 2012-08-09)
    • Towards Optimal Data Transmission by Network Coding 

      Ravanbakhsh, Mohammad (Doctoral thesis, 2009-12-16)
      Communication protocols based on coded schemes and, in particular, network coding promise increased efficiency for future networks. The field is still young. Nevertheless, many important results have been already obtained. ...
    • Towards Privacy Managment of Information Systems 

      Drageide, Vidar (Master thesis, 2009-06-02)
      This masters thesis provides insight into the concept of privacy. It argues why privacy is important, and why developers and system owners should keep privacy in mind when developing and maintaining systems containing ...
    • Towards stronger Lagrangean bounds for stable spanning trees 

      Dias, Phillippe Samer Lallo; Haugland, Dag (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 ...
    • Transversals of longest paths 

      Cerioli, Marcia R.; Fernandes, Cristina G.; Gómez, Renzo; Gutiérrez, Juan; Lima, Paloma T. (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 

      Maldonado, Isabel Chambi (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 ...
    • Triplicate functions 

      Budaghyan, Lilya; Ivkovic, Ivana; Kaleyski, Nikolay Stoyanov (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 ...
    • Two-tensor Fiber Tractography 

      Bergmann, Ørjan; Kindlmann, Gordon; Peled, Sharon; Westin, Carl-Fredrik (Peer reviewed; Journal article, 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 

      Bezem, Marcus A.; Hovland, Dag; Truong, Anh Hoang (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 

      Bezem, Marcus A.; Truong, Anh Hoang (Proceedings of FOCLASA 2003, the Foundations of Coordination Languages and Software Architectures, Journal article, 2003-09-02)
      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 

      Hovland, Dag (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 

      Truong, Anh Hoang (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 

      Hovland, Dag (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 

      Forssell, Jon Henrik; Gylterud, Håkon Robbestad; Spivak, David I (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 ...
    • Typical Sequences Revisited - Computing Width Parameters of Graphs 

      Bodlaender, Hans L.; Jaffke, Lars; Telle, Jan Arne (Journal article; Peer reviewed, 2021)
      In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obtain constructive linear time parameterized ...
    • Typical Sequences Revisited – Computing Width Parameters of Graphs 

      Bodlaender, Hans L.; Jaffke, Lars; Telle, Jan Arne (Journal article; Peer reviewed, 2020)
      In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obtain constructive linear time parameterized ...
    • Unitary Branching Programs: Learnability and Lower Bounds 

      Diaz Andino, Fidel Ernesto; Kokkou, Maria; Oliveira, Mateus De Oliveira; Vadiee, Farhad (Journal article; Peer reviewed, 2021)
      Bounded width branching programs are a formalism that can be used to capture the notion of non-uniform constant-space computation. In this work, we study a generalized version of bounded width branching programs where ...