Sciweavers

    1486 search results - page 3 / 298
    » Algorithms for two-box covering
    Sort
    View
    144
    Voted
    ICAI
    2010
    258views Artificial Intelligence» more  ICAI 2010»
    An Efficient Sequential Covering Algorithm for Explaining Subsets of Data
    15 years 23 days ago
    An Efficient Sequential Covering Algorithm for Explaining Subsets of Data
    Download  www.research.rutgers.edu
    Given a subset of data that differs from the rest, a user often wants an explanation as to why this is the case. For instance, in a database of flights, a user may want to understa...
    Matthew Michelson, Sofus A. Macskassy
    claim paper
    Read More »
    121
    Voted
    IPL
    2011
    112views more  IPL 2011»
    Improved approximation algorithms for minimum AND-circuits problem via k-set cover
    14 years 9 months ago
    Improved approximation algorithms for minimum AND-circuits problem via k-set cover
    Download  www.cis.shimane-u.ac.jp
    Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
    Hiroki Morizumi
    claim paper
    Read More »
    151
    Voted
    ISCI
    2011
    223views Natural Language Processing» more  ISCI 2011»
    Sequential covering rule induction algorithm for variable consistency rough set approaches
    14 years 9 months ago
    Sequential covering rule induction algorithm for variable consistency rough set approaches
    Download  www.cs.put.poznan.pl
    We present a general rule induction algorithm based on sequential covering, suitable for variable consistency rough set approaches. This algorithm, called VC-DomLEM, can be used f...
    Jerzy Blaszczynski, Roman Slowinski, Marcin Szelag
    claim paper
    Read More »
    160
    Voted
    CORR
    2010
    Springer
    178views Education» more  CORR 2010»
    Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
    15 years 1 months ago
    Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
    Download  www.cc.gatech.edu
    We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
    Daniel Dadush, Chris Peikert, Santosh Vempala
    claim paper
    Read More »
    73
    Voted
    NETWORKS
    2007
    77views Computer Networks» more  NETWORKS 2007»
    A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
    15 years 2 months ago
    A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
    Download  www.cs.uoi.gr
    Katerina Asdre, Stavros D. Nikolopoulos
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.