81 search results - page 1 / 17 » Even Faster Algorithm for Set Splitting! |
IWPEC
2009
Springer
13 years 12 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
ICFCA
2009
Springer
14 years 2 days ago
2009
Springer
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
ESA
2001
Springer
13 years 9 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
CORR
2011
Springer
13 years 9 days ago
2011
Springer
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
TIP
2010
13 years 19 hour ago
2010
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...