Sciweavers

    648 search results - page 9 / 130
    » Simple Algorithms for a Weighted Interval Selection Problem
    Sort
    View
    TCS
    2010
    186views Theoretical Computer Science» more  TCS 2010»
    A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
    13 years 6 months ago
    A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
    Download  www.cs.uoi.gr
    : We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
    Katerina Asdre, Stavros D. Nikolopoulos
    claim paper
    Read More »
    21
    Voted
    ECCV
    2006
    Springer
    202views Computer Vision» more  ECCV 2006»
    A Simple Solution to the Six-Point Two-View Focal-Length Problem
    14 years 9 months ago
    A Simple Solution to the Six-Point Two-View Focal-Length Problem
    Download  cmp.felk.cvut.cz
    Abstract. This paper presents a simple and practical solution to the 6-point 2view focal-length estimation problem. Based on the hidden-variable technique we have derived a 15th de...
    Hongdong Li
    claim paper
    Read More »
    IJCAI
    2007
    189views Artificial Intelligence» more  IJCAI 2007»
    A Hybrid Ontology Directed Feedback Selection Algorithm for Supporting Creative Problem Solving Dialogues
    13 years 9 months ago
    A Hybrid Ontology Directed Feedback Selection Algorithm for Supporting Creative Problem Solving Dialogues
    Download  ijcai.org
    We evaluate a new hybrid language processing approach designed for interactive applications that maintain an interaction with users over multiple turns. Specifically, we describe ...
    Hao-Chuan Wang, Rohit Kumar, Carolyn Penstein Ros&...
    claim paper
    Read More »
    JC
    2007
    101views more  JC 2007»
    Simple Monte Carlo and the Metropolis algorithm
    13 years 7 months ago
    Simple Monte Carlo and the Metropolis algorithm
    Download  users.minet.uni-jena.de
    We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
    Peter Mathé, Erich Novak
    claim paper
    Read More »
    SAT
    2010
    Springer
    172views Hardware» more  SAT 2010»
    On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
    13 years 6 months ago
    On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
    Download  www.cs.toronto.edu
    Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
    Denis Pankratov, Allan Borodin
    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.