Sciweavers

    ESORICS
    2012
    Springer
    263views Security Privacy» more  ESORICS 2012»
    Third-Party Private DFA Evaluation on Encrypted Files in the Cloud
    12 years 1 months ago
    Third-Party Private DFA Evaluation on Encrypted Files in the Cloud
    Download  www.cs.unc.edu
    Motivated by the need to outsource file storage to untrusted clouds while still permitting limited use of that data by third parties, we present practical protocols by which a cli...
    Lei Wei 0004, Michael K. Reiter
    claim paper
    Read More »
    CIE
    2011
    Springer
    261views Applied Computing» more  CIE 2011»
    Automatic Learners with Feedback Queries
    12 years 11 months ago
    Automatic Learners with Feedback Queries
    Download  www.comp.nus.edu.sg
    Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...
    John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukh...
    claim paper
    Read More »
    UC
    2010
    Springer
    250views Applied Computing» more  UC 2010»
    Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345
    13 years 9 months ago
    Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345
    Download  uncomp.uwe.ac.uk
    We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behavior yet capable for purposeful computation. The automaton implements Boolean gates via p...
    Genaro Juárez Martínez, Kenichi Mori...
    claim paper
    Read More »
    TIT
    2008
    106views more  TIT 2008»
    Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
    13 years 11 months ago
    Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
    Download  perso.citi.insa-lyon.fr
    This article describes new theoretical results concerning the general behavior of a Feedback with Carry Shift Register (FCSR) automaton. They help to better understand how the init...
    François Arnault, Thierry P. Berger, Marine...
    claim paper
    Read More »
    TCS
    2008
    108views Theoretical Computer Science» more  TCS 2008»
    Setting port numbers for fast graph exploration
    13 years 11 months ago
    Setting port numbers for fast graph exploration
    Download  www.labri.fr
    We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
    David Ilcinkas
    claim paper
    Read More »
    IJAC
    2007
    99views more  IJAC 2007»
    Normalized Expressions and Finite Automata
    13 years 11 months ago
    Normalized Expressions and Finite Automata
    Download  www.cmi.univ-mrs.fr
    There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...
    Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Zi...
    claim paper
    Read More »
    JFP
    2006
    113views more  JFP 2006»
    Efficient manipulation of binary data using pattern matching
    13 years 11 months ago
    Efficient manipulation of binary data using pattern matching
    Download  user.it.uu.se
    Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
    Per Gustafsson, Konstantinos F. Sagonas
    claim paper
    Read More »
    CORR
    2007
    Springer
    113views Education» more  CORR 2007»
    The road coloring problem
    13 years 11 months ago
    The road coloring problem
    Download  u.cs.biu.ac.il
    A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
    A. N. Trahtman
    claim paper
    Read More »
    ENTCS
    2008
    100views more  ENTCS 2008»
    A Calculus for Team Automata
    13 years 11 months ago
    A Calculus for Team Automata
    Download  fmt.isti.cnr.it
    Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...
    Maurice H. ter Beek, Fabio Gadducci, Dirk Janssens
    claim paper
    Read More »
    AMAI
    2006
    Springer
    85views Artificial Intelligence» more  AMAI 2006»
    Tableau-based automata construction for dynamic linear time temporal logic*
    13 years 11 months ago
    Tableau-based automata construction for dynamic linear time temporal logic*
    Download  www.di.unito.it
    We present a tableau-based algorithm for obtaining a B
    Laura Giordano, Alberto Martelli
    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.