Sciweavers

    IANDC
    2007
    151views more  IANDC 2007»
    Transducer-based analysis of cryptographic protocols
    14 years 12 days ago
    Transducer-based analysis of cryptographic protocols
    Download  people.inf.ethz.ch
    Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
    Ralf Küsters, Thomas Wilke
    claim paper
    Read More »
    IANDC
    2007
    152views more  IANDC 2007»
    The reactive simulatability (RSIM) framework for asynchronous systems
    14 years 12 days ago
    The reactive simulatability (RSIM) framework for asynchronous systems
    Download  eprint.iacr.org
    We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
    Michael Backes, Birgit Pfitzmann, Michael Waidner
    claim paper
    Read More »
    IANDC
    2007
    81views more  IANDC 2007»
    Some natural conditions on incremental learning
    14 years 12 days ago
    Some natural conditions on incremental learning
    Download  www.comp.nus.edu.sg
    The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requirements s...
    Sanjay Jain, Steffen Lange, Sandra Zilles
    claim paper
    Read More »
    IANDC
    2007
    83views more  IANDC 2007»
    Cluster computing and the power of edge recognition
    14 years 12 days ago
    Cluster computing and the power of edge recognition
    Download  www14.in.tum.de
    Lane A. Hemaspaandra, Christopher M. Homan, Sven K...
    claim paper
    Read More »
    IANDC
    2007
    76views more  IANDC 2007»
    Controlling information release in the pi-calculus
    14 years 12 days ago
    Controlling information release in the pi-calculus
    Download  www.dsi.unive.it
    Silvia Crafa, Sabina Rossi
    claim paper
    Read More »
    IANDC
    2007
    94views more  IANDC 2007»
    Mediating secure information flow policies
    14 years 12 days ago
    Mediating secure information flow policies
    Download  newton.eecs.cwru.edu
    In this paper we study secure information flow policies in the sense of Meadows [12] and others for aggregated datasets, collectively. We first present a method for combining di...
    Guo-Qiang Zhang
    claim paper
    Read More »
    IANDC
    2007
    66views more  IANDC 2007»
    Exponential lower bounds for the number of words of uniform length avoiding a pattern
    14 years 12 days ago
    Exponential lower bounds for the number of words of uniform length avoiding a pattern
    Download  people.math.sfu.ca
    We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
    Jason P. Bell, Teow Lim Goh
    claim paper
    Read More »
    IANDC
    2007
    107views more  IANDC 2007»
    Task automata: Schedulability, decidability and undecidability
    14 years 12 days ago
    Task automata: Schedulability, decidability and undecidability
    Download  user.it.uu.se
    We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
    Elena Fersman, Pavel Krcál, Paul Pettersson...
    claim paper
    Read More »
    IANDC
    2007
    117views more  IANDC 2007»
    Computing the edit distance of a regular language
    14 years 12 days ago
    Computing the edit distance of a regular language
    Download  cs.smu.ca
    The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
    Stavros Konstantinidis
    claim paper
    Read More »
    IANDC
    2007
    123views more  IANDC 2007»
    Hardness of fully dense problems
    14 years 12 days ago
    Hardness of fully dense problems
    Download  www.tau.ac.il
    In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
    Nir Ailon, Noga Alon
    claim paper
    Read More »
    123next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.