Sciweavers

    1243 search results - page 31 / 249
    » On the locality of bounded growth
    Sort
    View
    IWPEC
    2009
    Springer
    92views Applied Computing» more  IWPEC 2009»
    Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
    14 years 2 months ago
    Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
    Download  faculty.cs.tamu.edu
    Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
    Peter Damaschke
    claim paper
    Read More »
    APAL
    2011
    185views Software Engineering» more  APAL 2011»
    The provably total NP search problems of weak second order bounded arithmetic
    13 years 2 months ago
    The provably total NP search problems of weak second order bounded arithmetic
    Download  www.mimuw.edu.pl
    We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
    Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
    claim paper
    Read More »
    DATESO
    2007
    107views Database» more  DATESO 2007»
    Work with Knowledge on the Internet - Local Search
    13 years 9 months ago
    Work with Knowledge on the Internet - Local Search
    Download  sunsite.informatik.rwth-aachen.de
    Authors are looking within their research grant new original web local search algorithm respecting specifics of Czech national environment. We would like to initiate further debate...
    Antonin Pavlicek, Josef Muknsnabl
    claim paper
    Read More »
    NIPS
    2003
    180views Information Technology» more  NIPS 2003»
    Bounded Finite State Controllers
    13 years 9 months ago
    Bounded Finite State Controllers
    Download  books.nips.cc
    We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...
    Pascal Poupart, Craig Boutilier
    claim paper
    Read More »
    JMLR
    2010
    143views more  JMLR 2010»
    Rademacher Complexities and Bounding the Excess Risk in Active Learning
    13 years 2 months ago
    Rademacher Complexities and Bounding the Excess Risk in Active Learning
    Download  fodava.gatech.edu
    Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
    Vladimir Koltchinskii
    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.