Sciweavers

    3341 search results - page 564 / 669
    » On Bounded Queries and Approximation
    Sort
    View
    IMAGING
    2004
    180views Image Processing» more  IMAGING 2004»
    Mathematical Discontinuities in CIEDE2000 Color Difference Computations
    14 years 11 months ago
    Mathematical Discontinuities in CIEDE2000 Color Difference Computations
    Download  www.ece.rochester.edu
    We examine mathematical properties of the CIEDE2000 color difference formula and illustrate that the CIEDE2000 color difference is not a continuous function of the CIELAB color pa...
    Gaurav Sharma, Wencheng Wu, Edul N. Dalal, Mehmet ...
    claim paper
    Read More »
    OPODIS
    2004
    104views Distributed And Parallel Com...» more  OPODIS 2004»
    Searching for a Black Hole in Tree Networks
    14 years 11 months ago
    Searching for a Black Hole in Tree Networks
    Download  www-higashi.ist.osaka-u.ac.jp
    A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
    Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
    claim paper
    Read More »
    NIPS
    2001
    144views Information Technology» more  NIPS 2001»
    Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning
    14 years 11 months ago
    Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning
    Download  jmlr.csail.mit.edu
    Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
    Evan Greensmith, Peter L. Bartlett, Jonathan Baxte...
    claim paper
    Read More »
    STRINGOLOGY
    2004
    119views Programming Languages» more  STRINGOLOGY 2004»
    Conditional Inequalities and the Shortest Common Superstring Problem
    14 years 11 months ago
    Conditional Inequalities and the Shortest Common Superstring Problem
    Download  www.thi.informatik.uni-frankfurt.de
    We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
    Uli Laube, Maik Weinard
    claim paper
    Read More »
    VMV
    2003
    146views Visualization» more  VMV 2003»
    ADB-Trees: Controlling the Error of Time-Critical Collision Detection
    14 years 11 months ago
    ADB-Trees: Controlling the Error of Time-Critical Collision Detection
    Download  zach.in.tu-clausthal.de
    We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality ...
    Jan Klein, Gabriel Zachmann
    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-2025, USA.