432 search results - page 46 / 87 » Internally deterministic parallel algorithms can be fast |
123
click to vote
PVLDB
2010
15 years 9 days ago
2010
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the s...
130
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
126
click to vote
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
177
click to vote
STOC
1997
ACM
15 years 6 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
105
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...