Sciweavers

    567 search results - page 53 / 114
    » On the complexity of constrained VC-classes
    Sort
    View
    CCCG
    2007
    80views Computational Geometry» more  CCCG 2007»
    Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
    13 years 9 months ago
    Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
    Download  cccg.ca
    Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
    Arindam Karmakar, Sasanka Roy, Sandip Das
    claim paper
    Read More »
    CCCG
    2008
    116views Computational Geometry» more  CCCG 2008»
    Smallest enclosing circle centered on a query line segment
    13 years 9 months ago
    Smallest enclosing circle centered on a query line segment
    Download  cccg.ca
    Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
    Prosenjit Bose, Stefan Langerman, Sasanka Roy
    claim paper
    Read More »
    MASCOTS
    2008
    102views Modeling And Simulation» more  MASCOTS 2008»
    On the Stability of Best Effort Flow Control Mechanisms in On-Chip Architectures
    13 years 9 months ago
    On the Stability of Best Effort Flow Control Mechanisms in On-Chip Architectures
    Download  alum.sharif.ir
    In this paper we present a centralized flow control scheme in NoCs in the presence of both elastic and streaming flow traffic paradigms. We model the desired Best Effort (BE) sour...
    Mohammad Sadegh Talebi, Ahmad Khonsari
    claim paper
    Read More »
    RSS
    2007
    134views Robotics» more  RSS 2007»
    A Fast and Practical Algorithm for Generalized Penetration Depth Computation
    13 years 9 months ago
    A Fast and Practical Algorithm for Generalized Penetration Depth Computation
    Download  gamma.cs.unc.edu
    — We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
    Liangjun Zhang, Young J. Kim, Dinesh Manocha
    claim paper
    Read More »
    FLAIRS
    2001
    159views Artificial Intelligence» more  FLAIRS 2001»
    A Practical Markov Chain Monte Carlo Approach to Decision Problems
    13 years 9 months ago
    A Practical Markov Chain Monte Carlo Approach to Decision Problems
    Download  www.aaai.org
    Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
    Timothy Huang, Yuriy Nevmyvaka
    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.