We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 41-60 of 181 results
  1. Probabilistic Abstract Interpretation: From Trace Semantics to DTMC’s and Linear Regression

    In order to perform probabilistic program analysis we need to consider probabilistic languages or languages with a probabilistic semantics, as well...
    Alessandra Di Pierro, Herbert Wiklicky in Semantics, Logics, and Calculi
    Chapter 2016
  2. Optimal Paths for Variants of the 2D and 3D Reeds–Shepp Car with Applications in Image Analysis

    We present a PDE-based approach for finding optimal paths for the Reeds–Shepp car. In our model we minimize a (data-driven) functional involving both...

    R. Duits, S. P. L. Meesters, ... J. M. Portegies in Journal of Mathematical Imaging and Vision
    Article Open access 20 February 2018
  3. A Versatile Strategy for the Implementation of Adaptive Splines

    This paper presents an implementation framework for spline spaces over T-meshes (and their d-dimensional analogs). The aim is to share code between...
    Andrea Bressan, Dominik Mokriš in Mathematical Methods for Curves and Surfaces
    Conference paper 2017
  4. Techniques for Gradient-Based Bilevel Optimization with Non-smooth Lower Level Problems

    We propose techniques for approximating bilevel optimization problems with non-smooth lower level problems that can have a non-unique solution. To...

    Peter Ochs, René Ranftl, ... Thomas Pock in Journal of Mathematical Imaging and Vision
    Article 17 May 2016
  5. FSI Schemes: Fast Semi-Iterative Solvers for PDEs and Optimisation Methods

    Many tasks in image processing and computer vision are modelled by diffusion processes, variational formulations, or constrained optimisation...
    David Hafner, Peter Ochs, ... Sven Grewenig in Pattern Recognition
    Conference paper 2016
  6. Improving Cross-Traffic Bounds in Feed-Forward Networks – There is a Job for Everyone

    Network calculus provides a mathematical framework for deterministically bounding backlog and delay in packet-switched networks. The analysis is...
    Conference paper 2016
  7. Complexity of Anticipated Rejection Algorithms and the Darling–Mandelbrot Distribution

    We study in limit law the complexity of some anticipated rejection random sampling algorithms. We express this complexity in terms of a probabilistic...

    Axel Bacher, Andrea Sportiello in Algorithmica
    Article 31 July 2015
  8. Automated Distribution of Software to Multi-core Hardware in Model Based Embedded Systems Development

    Software-Map**, i.e. the map** of software elements to hardware components, is especially in the context of embedded multi-core systems a rather...
    Lukas Krawczyk, Carsten Wolff, Daniel Fruhner in Information and Software Technologies
    Conference paper 2015
  9. Exceptions

    Multi-exit loop and multi-level exit demonstrate the power of advanced control flow to reduce program complexity (flag variables) and eliminate...
    Peter A. Buhr in Understanding Control Flow
    Chapter 2016
  10. Erlangian approximation to finite time probability of blocking time of multi-class OBS nodes

    In an optical burst switching (OBS) network, the blocking time, representing the time interval during which the channel is occupied for a given class...

    Shengda Tang, Liansheng Tan in Photonic Network Communications
    Article 13 May 2015
  11. A (k, n) Multi Secret Sharing Scheme Using Two Variable One Way Function with Less Public Values

    In this paper we have proposed a perfect (k, n) multi secret sharing scheme based on YCH scheme. The YCH method shares m secrets at a time and it...
    Shyamalendu Kandar, Bibhas Chandra Dhara in Information Systems Security
    Conference paper 2015
  12. Transfinite Lyndon Words

    In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word,...
    Luc Boasson, Olivier Carton in Developments in Language Theory
    Conference paper 2015
  13. Learning Collective Crowd Behaviors with Dynamic Pedestrian-Agents

    Collective behaviors characterize the intrinsic dynamics of the crowds. Automatically understanding collective crowd behaviors has important...

    Bolei Zhou, **aoou Tang, **aogang Wang in International Journal of Computer Vision
    Article 14 June 2014
  14. Chronos: a NoSQL system on flash memory for industrial process data

    Within Électricité de France (EDF) hydroelectric power stations, IGCBoxes are industrial mini PCs dedicated to industrial process data archiving....

    Brice Chardin, Jean-Marc Lacombe, Jean-Marc Petit in Distributed and Parallel Databases
    Article 05 March 2015
  15. A Core Calculus for XQuery 3.0

    XML processing languages can be classified according to whether they extract XML data by paths or patterns. The strengths of one category correspond...
    Giuseppe Castagna, Hyeonseung Im, ... Véronique Benzaken in Programming Languages and Systems
    Conference paper 2015
  16. Policy Gradients for CVaR-Constrained MDPs

    We study a risk-constrained version of the stochastic shortest path (SSP) problem, where the risk measure considered is Conditional Value-at-Risk...
    L. A. Prashanth in Algorithmic Learning Theory
    Conference paper 2014
  17. Error analysis of explicit TSERKN methods for highly oscillatory systems

    In this paper, we are concerned with the error analysis for the two-step extended Runge-Kutta-Nyström-type (TSERKN) methods [Comput. Phys. Comm. 182...

    Jiyong Li, **nyuan Wu in Numerical Algorithms
    Article 30 August 2013
  18. Sustained Petascale Performance of Seismic Simulations with SeisSol on SuperMUC

    Seismic simulations in realistic 3D Earth models require peta- or even exascale computing power to capture small-scale features of high relevance for...
    Alexander Breuer, Alexander Heinecke, ... Christian Pelties in Supercomputing
    Conference paper 2014
  19. 3D Shape Reconstruction

    This chapter describes three different techniques for vision-based reconstruction of 3D shapes. The use of structured lighting is a relatively simple...
    Reinhard Klette in Concise Computer Vision
    Chapter 2014
Did you find what you were looking for? Share feedback.