728 search results - page 142 / 146 » Efficient Searching with Linear Constraints |
ALGORITHMICA
2006
14 years 11 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
TIT
2002
14 years 11 months ago
2002
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
114
click to vote
KDD
2006
ACM
16 years 4 days ago
2006
ACM
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
107
click to vote
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
—We demonstrate that receive antenna selection (RAS) provides significant increase in the achievable sum rates for multi-user MIMO wireless downlinks that employ block diagonaliz...
95
Voted
KDD
2010
ACM
15 years 3 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...