1421 search results - page 91 / 285 » Algorithms for subsequence combinatorics |
128
Voted
EUROPAR
2005
Springer
15 years 9 months ago
2005
Springer
Most research in the area of publish/subscribe systems has not considered fault-tolerance as a central design issues. However, faults do obviously occur and masking all faults is a...
122
click to vote
CCGRID
2004
IEEE
15 years 8 months ago
2004
IEEE
1 Scheduling resources on Grids is a well-known problem. The extension of Grids to LambdaGrids requires scheduling of lambdas, i.e., end-to-end high-speed circuits. In this paper, ...
165
click to vote
BIBM
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract--Medical image segmentation has become an essential technique in clinical and research-oriented applications. Because manual segmentation methods are tedious, and fully au...
161
click to vote
COCOON
1999
Springer
15 years 8 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
140
click to vote
KDD
2003
ACM
16 years 4 months ago
2003
ACM
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...