418 search results - page 12 / 84 » A New Pattern Representation Scheme Using Data Compression |
102
Voted
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Many man-made and natural structures consist of similar elements arranged in regular patterns. In this paper we present an unsupervised approach for discovering and reasoning on re...
88
Voted
ICCD
2004
IEEE
15 years 9 months ago
2004
IEEE
Many test data compression schemes are based on LFSR reseeding. A drawback of these schemes is that the unspecified bits are filled with random values resulting in a large number ...
107
Voted
ICPP
2003
IEEE
15 years 6 months ago
2003
IEEE
Hardware prefetching is a simple and effective technique for hiding cache miss latency and thus improving the overall performance. However, it comes with addition of prefetch buff...
91
Voted
IWMMDBMS
1998
15 years 2 months ago
1998
Recent research has shown that near optimal performance can be achieved by adaptive block replacement policies that use user-level hints regarding the block reference pattern. How...
113
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...