Now showing items 161-180 of 273

  • Obscurance-based Volume Rendering Framework 

    Ruiz, Marc; Boada, Imma; Viola, Ivan; Bruckner, Stefan; Feixas, Miquel; Sbert, Mateu (The Eurographics Association, 2008)
    lighting effects in a faster way than global illumination. Its application in volume visualization is of special interest since it permits us to generate a high quality rendering at a low cost. In this paper, we propose ...
    Peer reviewedConference object
  • OLS Dialog: An open-source front end to the Ontology Lookup Service 

    Barsnes, Harald; Côté, Richard G.; Eidhammer, Ingvar; Martens, Lennart (BioMed Central, 2010-01-17)
    Background: With the growing amount of biomedical data available in public databases it has become increasingly important to annotate data in a consistent way in order to allow easy access to this rich source of information. ...
    Journal articlePeer reviewed
  • On a New Method for Derivative Free Optimization 

    Frimannslund, Lennart; Steihaug, Trond (IARIA, 2011)
    A new derivative-free optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an ...
    Journal article
  • On Connections Between Graphs, Codes, Quantum States, and Boolean Functions 

    Danielsen, Lars Eirik (The University of Bergen, 2008-05-28)
    We study objects that can be represented as graphs, error-correcting codes, quantum states, or Boolean functions. It is known that self-dual additive codes, which can also be interpreted as quantum states, can be ...
    Doctoral thesis
  • On Curvature and Separability in Unconstrained Optimisation 

    Frimannslund, Lennart (The University of Bergen, 2006-06-16)
    Doctoral thesis
  • On cutwidth parameterized by vertex cover 

    Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Saurabh, Saket (Springer, 2014-04)
    We study the CUTWIDTH problem, where the input is a graph G, and the objective is find a linear layout of the vertices that minimizes the maximum number of edges intersected by any vertical line inserted between two ...
    Journal article
  • On iterative decoding of high-density parity-check codes using edge-local complementation 

    Knudsen, Joakim Grahl (The University of Bergen, 2010-11-24)
    The overall topic of this work is a graph operation known as edgelocal complementation (ELC) and its applications to iterative decoding of classical codes. Although these legacy codes are arguably not well-suited for ...
    Doctoral thesis
  • On Self-Dual Quantum Codes, Graphs, and Boolean Functions 

    Danielsen, Lars Eirik (The University of Bergen, 2005)
    A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing ...
    Master thesis
  • On the Classification of Hermitian Self-Dual Additive Codes over GF(9) 

    Danielsen, Lars Eirik (Institute of Electrical and Electronics Engineers, 2012-08)
    Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. ...
    Peer reviewedJournal article
  • On the feasibility of distributed systems for interactive visual analysis of omics data 

    Farag, Yehia Mohamed (The University of Bergen, 2014-06-02)
    The purpose of this thesis is to discuss the feasibility of developing a distributed interactive visual analysis omics system demonstrating how selected modules from the standalone J-Express Modularized application ...
    Master thesis
  • On the Privacy of Two Tag Ownership Transfer Protocols for RFIDs 

    Abyaneh, Mohammad Reza Sohizadeh (The author, 2012)
    In this paper, the privacy of two recent RFID tag ownership transfer protocols are investigated against the tag owners as adversaries. The first protocol called ROTIV is a scheme which provides a privacy-preserving ...
    Conference object
  • On the Security of Non-Linear HB (NLHB) Protocol Against Passive Attack 

    Abyaneh, Mohammad Reza Sohizadeh (The author, 2012)
    As a variant of the HB authentication protocol for RFID systems, which relies on the complexity of decoding linear codes against passive attacks, Madhavan et al. presented Non-Linear HB(NLHB) protocol. In contrast to ...
    Conference object
  • Optimal preparation of graph states 

    Cabello, Adán; Danielsen, Lars Eirik; López-Tarrida, Antonio J.; Portillo, José R. (American Physical Society, 2011-04-12)
    We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits ...
    Peer reviewedJournal article
  • Optimal ternary cyclic codes with minimum distance four and five 

    Li, Nian; Li, Chunlei; Helleseth, Tor; Ding, Cunsheng; Tang, Xiaohu (Elsevier, 2014-11)
    Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are ...
    Journal article
  • Optimization issues in medical imaging and fiber-tracking 

    Bergmann, Ørjan (The University of Bergen, 2008-02-27)
    Fiber tracking is a relatively recent methodology, made possible by access to new highly advanced MR scanners able to produce high-quality diffusion tensor images (DTI), which promises clinicians a possibility to observe ...
    Doctoral thesis
  • Optimization Models for Turbine Location in Wind Farms 

    Haugland, Jan Kristian (The University of Bergen, 2012-05-24)
    The topic of this thesis is wind farm optimization. The goal is to be able to decide where to install wind turbines within a given region in order to maximize the power output in two different scenarios: For a fixed number ...
    Master thesis
  • Parallel Graph Algorithms for Combinatorial Scientific Computing 

    Patwary, Mostofa Ali (The University of Bergen, 2011-08-26)
    Doctoral thesis
  • Parameterized complexity of Eulerian deletion problems 

    Cygan, Marek; Pilipczuk, Marcin; Marx, Dániel; Pilipczuk, Michal Pawel; Schlotter, Ildikó (Springer, 2014-01)
    We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity ...
    Journal article
  • Parsing in a Broad Sense 

    Zaytsev, Vadim; Bagge, Anya Helene (Springer, 2014)
    Having multiple representations of the same instance is common in software language engineering: models can be visualised as graphs, edited as text, serialised as XML. When mappings between such representations are considered, ...
  • Passive Cryptanalysis of the UnConditionally Secure Authentication Protocol for RFID Systems 

    Abyaneh, Mohammad Reza Sohizadeh (The author, 2012)
    Recently, Alomair et al. proposed the first Un- Conditionally Secure mutual authentication protocol for lowcost RFID systems(UCS-RFID). The security of the UCSRFID relies on five dynamic secret keys which are updated at ...
    Conference object