2392 search results - page 270 / 479 » Matching data dissemination algorithms to application requir... |
189
click to vote
CIKM
2004
Springer
16 years 19 hour ago
2004
Springer
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
194
Voted
WFLP
2000
Springer
15 years 10 months ago
2000
Springer
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
183
click to vote
FGCS
2006
15 years 6 months ago
2006
Tw o parallel programming models represented b y OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an app...
169
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
207
click to vote
SOSP
2007
ACM
16 years 3 months ago
2007
ACM
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...