Blar i Department of Informatics på dokumenttype "Chapter"

Viser treff 21-40 av 50

    • Machine Learning Approaches for Biomarker Discovery Using Gene Expression Data 

      Zhang, Xiaokang; Jonassen, Inge; Goksøyr, Anders (Chapter, 2021)
      Biomarkers are of great importance in many fields, such as cancer research, toxicology, diagnosis and treatment of diseases, and to better understand biological response mechanisms to internal or external intervention. ...

    • Measures in Visualization Space 

      Bolte, Fabian; Bruckner, Stefan (Chapter, 2020)
      Measurement is an integral part of modern science, providing the fundamental means for evaluation, comparison, and prediction. In the context of visualization, several different types of measures have been proposed, ranging ...

    • The mersenne low hamming combination search problem can be reduced to an ILP problem 

      Budroni, Alessandro; Tenti, Andrea (Lecture Notes in Computer Science, Chapter; Peer reviewed; Journal article, 2019)
      In 2017, Aggarwal, Joux, Prakash, and Santha proposed an innovative NTRU-like public-key cryptosystem that was believed to be quantum resistant, based on Mersenne prime numbers q=2N−1 . After a successful attack designed ...

    • A New Generating Set Search Algorithm for Partially Separable Functions 

      Frimannslund, Lennart; Steihaug, Trond (Chapter; Peer reviewed, 2010)
      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 ...

    • Obscurance-based Volume Rendering Framework 

      Ruiz, Marc; Boada, Imma; Viola, Ivan; Bruckner, Stefan; Feixas, Miquel; Sbert, Mateu (Chapter; Peer reviewed, 2008)
      Obscurances, from which ambient occlusion is a particular case, is a technology that produces natural-looking lighting effects in a faster way than global illumination. Its application in volume visualization is of special ...

    • On Isotopic Shift Construction for Planar Functions 

      Budaghyan, Lilya; Calderini, Marco; Carlet, Claude; Coulter, Robert; Villa, Irene (Chapter; Peer reviewed, 2019)
      CCZ-equivalence is the most general currently known equivalence relation for functions over finite fields preserving planarity and APN properties. However, for the particular case of quadratic planar functions isotopic ...

    • On KDE-based brushing in scatterplots and how it compares to CNN-based brushing 

      Fan, Chaoran; Hauser, Helwig (Chapter, 2019)
      In this paper, we investigate to which degree the human should be involved into the model design and how good the empirical model can be with more careful design. To find out, we extended our previously published Mahalanobis ...

    • On Stable Marriages and Greedy Matchings 

      Manne, Fredrik; Naim, Md.; Lerring, Håkon; Halappanavar, Mahantesh (Chapter; Peer reviewed, 2016)
      Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. We consider ...

    • On the Privacy of Two Tag Ownership Transfer Protocols for RFIDs 

      Abyaneh, Mohammad Reza Sohizadeh (Chapter, 2011)
      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 ownership ...

    • Optimizing Approximate Weighted Matching on Nvidia Kepler K40 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino; Langguth, Johannes (Chapter; Peer reviewed, 2018)
      Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand ...

    • Parsing in a Broad Sense 

      Zaytsev, Vadim; Bagge, Anya Helene (Lecture Notes in Computer Science: 8767, Chapter; Peer reviewed, 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, ...

    • Phase Transition in a System of Random Sparse Boolean Equations 

      Schilling, Thorsten Ernst; Zajac, Pavol (Chapter; Peer reviewed, 2012)
      Many problems, including algebraic cryptanalysis, can be transformed to a problem of solving a (large) system of sparse Boolean equations. In this article we study 2 algorithms that can be used to remove some redundancy ...

    • Pooling Problems with Single-Flow Constraints 

      Haugland, Dag (Chapter; Peer reviewed, 2019)
      The pooling problem is a frequently studied extension of the traditional minimum cost flow problem, in which the composition of the flow is subject to restrictions. In a network consisting of three layers of nodes, the ...

    • A Practical Adaptive Key Recovery Attack on the LGM (GSW-like) Cryptosystem 

      Fauzi, Prastudy; Hovd, Martha Norberg; Raddum, Håvard (Chapter, 2021)
      We present an adaptive key recovery attack on the leveled homomorphic encryption scheme suggested by Li, Galbraith and Ma (Provsec 2016), which itself is a modification of the GSW cryptosystem designed to resist key recovery ...

    • A Pretty Good Formatting Pipeline 

      Bagge, Anya Helene; Hasu, Tero (Lecture Notes in Computer Science; 8225, Chapter; Peer reviewed, 2013)
      Proper formatting makes the structure of a program apparent and aids program comprehension. The need to format code arises in code generation and transformation, as well as in normal reading and editing situations. Commonly ...

    • Regular Expressions with Numerical Constraints and Automata with Counters 

      Hovland, Dag (Lecture Notes in Computer Science, Chapter; Peer reviewed, 2009)
      Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be matched. Expressions in this extension describe the ...

    • Separating Exceptional Concerns 

      Bagge, Anya Helene (IEEE conference proceedings, Chapter; Peer reviewed, 2012)
      Traditional error handling mechanisms, including exceptions, have several weaknesses that interfere with maintainability, flexibility and genericity in software: Error code is tangled with normal code; reporting is tangled ...

    • The SHIP Validator: An Annotation-based Content-Validation Framework for Java Applications 

      Mancini, Federico; Hovland, Dag; Mughal, Khalid A. (Chapter; Peer reviewed, 2010)
      In this paper, we investigate the use of Java annotations for software security purposes. In particular, we implement a framework for content validation where the validation tests are specified by annotations. This approach ...

    • Similarity-based Exploded Views 

      Ruiz, Marc; Viola, Ivan; Boada, Imma; Bruckner, Stefan; Feixas, Miquel; Sbert, Mateu (Lecture Notes in Computer Science; 5166, Chapter; Peer reviewed, 2008)
      Exploded views are often used in illustration to overcome the problem of occlusion when depicting complex structures. In this paper, we propose a volume visualization technique inspired by exploded views that partitions ...

    • Solving Compressed Right Hand Side Equation Systems with Linear Absorption 

      Schilling, Thorsten Ernst; Raddum, Håvard (Lecture Notes in Computer Science; 7280, Chapter; Peer reviewed, 2012)
      In this paper we describe an approach for solving complex multivariate equation systems related to algebraic cryptanalysis. The work uses the newly introduced Compressed Right Hand Sides (CRHS) representation, where equations ...