377 search results - page 26 / 76 » A Fast Heuristic Algorithm for a Probe Mapping Problem |
SODA
1998
ACM
13 years 10 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
PKDD
2005
Springer
14 years 2 months ago
2005
Springer
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
EGITALY
2006
13 years 10 months ago
2006
Palette re-ordering is a well known and very effective approach for improving the compression of color-indexed images. If the spatial distribution of the indexes in the image is s...
ICOIN
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...