728 search results - page 142 / 146 » Efficient Searching with Linear Constraints |
165
click to vote
ALGORITHMICA
2006
15 years 6 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...
162
click to vote
TIT
2002
15 years 6 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...
195
click to vote
KDD
2006
ACM
16 years 7 months 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 ...
183
click to vote
GLOBECOM
2006
IEEE
16 years 18 days 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...
183
click to vote
KDD
2010
ACM
15 years 10 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...