3172 search results - page 10 / 635 » On the Random-Self-Reducibility of Complete Sets |
EOR
2002
13 years 9 months ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
IPL
2002
13 years 9 months ago
2002
It is shown that for any class C closed under linear-time reductions, the complete sets for C under sublogarithmic reductions are also complete under 2DFA reductions, and thus are...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
CSFW
2006
IEEE
14 years 3 months ago
2006
IEEE
An attack mutation algorithm takes a known instance of an attack and transforms it into many distinct instances by repeatedly applying attack transformations. Such algorithms are ...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we propose a novel method for feature extraction and recognition, namely, Complete Fuzzy LDA (CFLDA). CFLDA combines the complete LDA and fuzzy set theory. CFLDA re...