Search Sciweavers | Sciweavers

16

ICAI
2010

258views Artificial Intelligence» more ICAI 2010»

An Efficient Sequential Covering Algorithm for Explaining Subsets of Data

13 years 4 months ago

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 »

16

click to vote

IPL
2011

112views more IPL 2011»

Improved approximation algorithms for minimum AND-circuits problem via k-set cover

13 years 1 months ago

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 »

19

click to vote

ISCI
2011

223views Natural Language Processing» more ISCI 2011»

Sequential covering rule induction algorithm for variable consistency rough set approaches

13 years 1 months ago

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 »

19

click to vote

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

13 years 4 months ago

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 »

11

click to vote

NETWORKS
2007

77views Computer Networks» more NETWORKS 2007»

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs

13 years 5 months ago