Viser treff 457-476 av 552

• #### Solving Equation Systems by Agreeing and Learning ﻿

(Chapter; Peer reviewed, 2010)
We study sparse non-linear equation systems defined over a finite field. Representing the equations as symbols and using the Agreeing algorithm we show how to learn and store new knowledge about the system when a ...
• #### Solving LPN Using Covering Codes ﻿

(Peer reviewed; Journal article, 2019-10-15)
We present a new algorithm for solving the LPN problem. The algorithm has a similar form as some previous methods, but includes a new key step that makes use of approximations of random words to a nearest codeword in a ...
• #### Solving System of Nonlinear Equations Using Methods in the Halley Class ﻿

(Master thesis, 2009-05-26)
In this thesis a new iterative frame work to solve the nonlinear system of equations $F(x)=0$ in n-dimensional real space is established. This iterative frame work is based on a quadratic model of the function $F(x)$ ...
• #### Solving the 2-disjoint connected subgraphs problem faster than 2ⁿ ﻿

(Peer reviewed; Journal article, 2014-10)
The 2-DISJOINT CONNECTED SUBGRAPHS problem, given a graph along with two disjoint sets of terminals Z1,Z2, asks whether it is possible to find disjoint sets A1,A2, such that Z1 ⊆ A1, Z2 ⊆ A2 and A1,A2 induce connected ...
• #### Solving the pooling problem with LMI relaxations ﻿

(Chapter; Peer reviewed, 2012)
We consider the standard pooling problem with a single quality parameter, which is a polynomial global optimization problem occurring among other places in the oil industry. In this paper, we show that if the feasible set ...
• #### Sparse Boolean equations and circuit lattices ﻿

(Peer reviewed; Journal article, 2010)
A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard problem in the cryptanalysis of modern ciphers. In ...
• #### Sparse Nerves in Practice ﻿

(Peer reviewed; Journal article, 2019)
Topological data analysis combines machine learning with methods from algebraic topology. Persistent homology, a method to characterize topological features occurring in data at multiple scales is of particular interest. ...
• #### Speaker recognition implemented as part of a video-editing system ﻿

(Master thesis, 2019-06-29)
With machine learning rising to prominence over the last decades, a lot of companies are doing research on how it can be applied in their products or production. Some of these companies have used machine learning with a ...
• #### Spiking Neural Networks for Pattern Recognition ﻿

(Master thesis, 2017)
We have investigated an existing theoretical model for spiking neural networks, and based on this model we have implemented our own network. Then we have carried out experiments with this network, and compared its performance ...
• #### SplitStreams: A Visual Metaphor for Evolving Hierarchies ﻿

(Peer reviewed; Journal article, 2020)
The visualization of hierarchically structured data over time is an ongoing challenge and several approaches exist trying to solve it. Techniques such as animated or juxtaposed tree visualizations are not capable of providing ...
• #### The State of the Art in Topology-based Visualization of Unsteady Flow ﻿

(Peer reviewed; Journal article, 2011)
Vector fields are a common concept for the representation of many different kinds of flow phenomena in science and engineering. Methods based on vector field topology are known for their convenience for visualizing and ...
• #### Statistical and Algebraic Properties of DES ﻿

(Lecture Notes in Computer Science ; 9589, Chapter; Journal article, 2016)
D. Davies and S. Murphy found that there are at most 660 different probability distributions on the output from any three adjacent S-boxes after 16 rounds of DES. In this paper it is shown that there are only 72 different ...
• #### A Statistics-based Dimension Reduction of the Space of Path Line Attributes for Interactive Visual Flow Analysis ﻿

(Peer reviewed; Journal article, 2012)
Recent work has shown the great potential of interactive flow analysis by the analysis of path lines. The choice of suitable attributes, describing the path lines, is, however, still an open question. This paper addresses ...
• #### Strategic optimization of offshore wind farm installation ﻿

(Lecture Notes in Computer Science, Chapter; Peer reviewed; Journal article, 2017)
This work describes logistical planning of offshore wind farm (OWF) installation through linear programming. A mixed integer linear programming (MILP) model is developed to analyze cost-effective port and vessel strategies ...
• #### Structure of Polynomial-Time Approximation ﻿

(Peer reviewed; Journal article, 2011-10-14)
Approximation schemes are commonly classified as being either a polynomial-time approximation scheme (ptas) or a fully polynomial-time approximation scheme (fptas). To properly differentiate between approximation schemes ...
• #### Strukturering av data for internettbehandling av pasienter med depresjon ﻿

(Master thesis, 2018-08-21)
Depresjon er et globalt voksende problem med store direkte og indirekte økonomiske belastninger. Internettbasert behandling som har vist seg å gi god effekt for enkelte kategorier av pasienter med depresjon. For et av ...
• #### En studie av mesh-traverseringsmønstre for Sophus-biblioteket og kjøretids variasjoner på SGI Origin ﻿

(Master thesis, 2002)
• #### Støtte for Geodata i Dynamic Presentation Generator ﻿

(Master thesis, 2012-01-27)
• #### Støtte for rike klienter i Dynamic Presentation Generator ﻿

(Master thesis, 2010-06-01)
Denne oppgaven beskriver hvordan det kan legges til støtte for rike klienter i Dynamic Presentation Generator (DPG). Oppgaven tar for seg både server og klientsiden av temaet. DPG er et innholdshåndteringssystem utviklet ...
• #### Subdivisions in digraphs of large out-degree or large dichromatic number ﻿

(Journal article; Peer reviewed, 2019)
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-degree at least f ( k ) contains a subdivision of the transitive tournament of order k . This conjecture is still completely ...