Sciweavers

1486 search results - page 3 / 298
» Algorithms for two-box covering
Sort
View
ICAI
2010
14 years 9 months ago
An Efficient Sequential Covering Algorithm for Explaining Subsets of Data
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
99
Voted
IPL
2011
112views more  IPL 2011»
14 years 6 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
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
ISCI
2011
14 years 6 months ago
Sequential covering rule induction algorithm for variable consistency rough set approaches
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
114
Voted
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 10 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
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