Sciweavers

    2011 search results - page 390 / 403
    » Universal Reinforcement Learning
    Sort
    View
    WSC
    2007
    104views Modeling And Simulation» more  WSC 2007»
    What I wish they would have taught me (or that I would have better remembered!) in school
    13 years 10 months ago
    What I wish they would have taught me (or that I would have better remembered!) in school
    Download  www.informs-sim.org
    This panel reflects upon their experiences as simulation professionals and shares their thoughts regarding elements of their simulation education that they have found most helpful...
    Charles R. Standridge, Daniel A. Finke, Carley Jur...
    claim paper
    Read More »
    COLT
    2008
    Springer
    213views Machine Learning» more  COLT 2008»
    Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
    13 years 9 months ago
    Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
    Download  colt2008.cs.helsinki.fi
    A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
    Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
    claim paper
    Read More »
    IWC
    2008
    99views more  IWC 2008»
    Pedagogy and usability in interactive algorithm visualizations: Designing and evaluating CIspace
    13 years 8 months ago
    Pedagogy and usability in interactive algorithm visualizations: Designing and evaluating CIspace
    Download  www.cs.washington.edu
    Interactive algorithm visualizations (AVs) are powerful tools for teaching and learning concepts that are difficult to describe with static media alone. However, while countless A...
    Saleema Amershi, Giuseppe Carenini, Cristina Conat...
    claim paper
    Read More »
    DC
    2007
    80views Internet Technology» more  DC 2007»
    On private computation in incomplete networks
    13 years 8 months ago
    On private computation in incomplete networks
    Download  www.cs.bgu.ac.il
    Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
    Amos Beimel
    claim paper
    Read More »
    IACR
    2011
    196views more  IACR 2011»
    Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
    12 years 7 months ago
    Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
    Download  www.cs.ucla.edu
    Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
    Gilad Asharov, Abhishek Jain, Daniel Wichs
    claim paper
    Read More »
    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.