845 search results - page 115 / 169 » Complexity Dimensions and Learnability |
143
click to vote
STOC
2006
ACM
16 years 4 days ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
169
click to vote
VLDB
2005
ACM
16 years 1 days ago
2005
ACM
Abstract. The outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. Most such applications are...
107
click to vote
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
The outlier detection problem has important applications in the eld of fraud detection, network robustness analysis, and intrusion detection. Most such applications are high dimen...
EDBT
2008
ACM
15 years 12 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
DCC
2006
IEEE
15 years 11 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...