Sciweavers

    AI
    1999
    Springer
    169views Artificial Intelligence» more  AI 1999»
    Emergent Cooperative Goal-Satisfaction in Large Scale Automated-Agent Systems
    13 years 9 months ago
    Emergent Cooperative Goal-Satisfaction in Large Scale Automated-Agent Systems
    Download  www.ri.cmu.edu
    Cooperation among autonomous agents has been discussed in the DAI community for several years. Papers about cooperation 6,45 , negotiation 33 , distributed planning 5 , and coalit...
    Onn Shehory, Sarit Kraus, Osher Yadgar
    claim paper
    Read More »
    AI
    1999
    Springer
    143views Artificial Intelligence» more  AI 1999»
    Coalition Structure Generation with Worst Case Guarantees
    13 years 9 months ago
    Coalition Structure Generation with Worst Case Guarantees
    Download  www.cs.cmu.edu
    Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coal...
    Tuomas Sandholm, Kate Larson, Martin Andersson, On...
    claim paper
    Read More »
    IJCV
    2002
    99views more  IJCV 2002»
    Subjective Surfaces: A Geometric Model for Boundary Completion
    13 years 9 months ago
    Subjective Surfaces: A Geometric Model for Boundary Completion
    Download  math.berkeley.edu
    We present a geometric model and a computational method for segmentation of images with missing boundaries. In many situations, the human visual system fills in missing gaps in ed...
    Alessandro Sarti, Ravi Malladi, James A. Sethian
    claim paper
    Read More »
    IJCV
    2002
    96views more  IJCV 2002»
    A VLSI-Compatible Computer Vision Algorithm for Stereoscopic Depth Analysis in Real-Time
    13 years 9 months ago
    A VLSI-Compatible Computer Vision Algorithm for Stereoscopic Depth Analysis in Real-Time
    Download  www.berndporr.me.uk
    The analysis of the depth coordinates of objects in a visual scene is of vital importance for animals as well as in technological applications like autonomous robot navigation or p...
    Bernd Porr, Bernd Nürenberg, Florentin Wö...
    claim paper
    Read More »
    IJCV
    2002
    129views more  IJCV 2002»
    A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming
    13 years 9 months ago
    A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming
    Download  www.cs.unc.edu
    In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost fun...
    G. Van Meerbergen, Maarten Vergauwen, Marc Pollefe...
    claim paper
    Read More »
    CN
    1998
    64views more  CN 1998»
    Decentralized Network Connection Preemption Algorithms
    13 years 9 months ago
    Decentralized Network Connection Preemption Algorithms
    Download  www.cs.uic.edu
    Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
    Mohammad Peyravian, Ajay D. Kshemkalyani
    claim paper
    Read More »
    CGF
    1998
    101views more  CGF 1998»
    Rapid and Accurate Contact Determination between Spline Models using ShellTrees
    13 years 9 months ago
    Rapid and Accurate Contact Determination between Spline Models using ShellTrees
    Download  ftp.cs.unc.edu
    In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
    Shankar Krishnan, M. Gopi, Ming C. Lin, Dinesh Man...
    claim paper
    Read More »
    CGF
    1998
    118views more  CGF 1998»
    An Exhaustive Error-Bounding Algorithm for Hierarchical Radiosity
    13 years 9 months ago
    An Exhaustive Error-Bounding Algorithm for Hierarchical Radiosity
    Download  hal.archives-ouvertes.fr
    This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...
    Nicolas Holzschuch, François X. Sillion
    claim paper
    Read More »
    ALGORITHMICA
    1998
    94views more  ALGORITHMICA 1998»
    A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
    13 years 9 months ago
    A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
    Download  www.cs.brown.edu
    In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
    Philip N. Klein, Sairam Subramanian
    claim paper
    Read More »
    AI
    1998
    Springer
    103views Artificial Intelligence» more  AI 1998»
    Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms
    13 years 9 months ago
    Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms
    Download  www.cs.utsa.edu
    The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
    Tom Bylander
    claim paper
    Read More »
    « first‹ previous…626364656667686970…next ›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.