LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Name
Dagstuhl Research Online Publication Server
Type
Institutional Repository
Items
7919 Publications
Compatibility
OpenAIRE Basic (DRIVER OA)
OAI-PMH
http://drops.dagstuhl.de/opus/phpoai/oai2.php
More information
Detailed data provider information (OpenDOAR)

 

  • Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits

    Kayal, Neeraj; Nair, Vineet; Saha, Chandan (2016)
    We show an exponential separation between two well-studied models of algebraic computation, namely read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits. In particular we show the following: 1. There exists an explicit n-variate polynomial computable by linear sized multilinear depth three circuits (with only two product gates) such that every ROABP computing it requires 2^{Omega(n)} size. 2. Any multilinear depth three circuit computing IMM_{...

    A Novel Algorithm for Distributed Dynamic Interference Coordination in Cellular Networks

    Necker, Marc C. (2011)
    Wireless systems based on Orthogonal Frequency Division Multiple Access (OFDMA) multiplex different users in time and frequency. One of the main problems in OFDMA-systems is the inter-cell interference. A promising approach to solve this problem is interference coordination (IFCO). In this paper, we present a novel distributed IFCO scheme, where a central coordinator communicates coordination information in regular time intervals. This information is the basis for a local inner optimization i...

    Application of verification techniques to inverse monoids

    Lohrey, Markus (2008)
    The word problem for inverse monoids generated by a set $Gamma$ subject to relations of the form $e=f$, where $e$ and $f$ are both idempotents in the free inverse monoid generated by $Gamma$, is investigated. It is shown that for every fixed monoid of this form the word problem can be solved in polynomial time which solves an open problem of Margolis and Meakin. For the uniform word problem, where the presentation is part of the input, EXPTIME-completeness is shown. Fo...

    08381 Executive Summary -- Computational Complexity of Discrete Problems

    Miltersen, Peter Bro; Reischuk, RĂ¼diger; Schnitger, Georg; van Melkebeek, Dieter (2008)
    Estimating the computational complexity of discrete problems constitutes one of the central and classical topics in the theory of computation. Mathematicians and computer scientists have long tried to classify natural families of Boolean relations according to fundamental complexity measures like time and space, both in the uniform and in the nonuniform setting. Several models of computation have been developed in order to capture the various capabilities of digital computing devices, includi...

    GerManC - Towards a Methodology for Constructing and Annotating Historical Corpora

    Ensslin, Astrid; Durrell, Martin; Bennett, Paul (2007)
    Our paper focuses on the one hand on the challenges posed by the structural variability, flexibility and ambiguity found in historical corpora and evaluates methods of dealing with them on the other. We are currently engaged in a project which aims to compile a representative corpus of German for the period 1650-1800. Looking at exemplary data from the first stage of this project (1650-1700), which consists of newspaper texts from this period, we first aim from the perspective of corpus l...
  • No data provider research data found
  • Latest Documents Timeline

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Document Types

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Funders in data provider publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Projects with most Publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

Share - Bookmark