4212 search results - page 247 / 843 » On Compressible Pairings and Their Computation |
252
click to vote
DCC
2011
IEEE
15 years 2 months ago
2011
IEEE
—We propose a method to improve traditional character-based PPM text compression algorithms. Consider a text file as a sequence of alternating words and non-words, the basic ide...
167
click to vote
ECCV
2006
Springer
16 years 9 months ago
2006
Springer
A novel shape descriptor is introduced. It groups pairs of points that share a geometrical property that is based on their mutual symmetry. The descriptor is visualized as a diagon...
190
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
184
click to vote
SOFSEM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
143
click to vote
KIVS
2005
Springer
16 years 25 days ago
2005
Springer
: This paper presents a new TCP-based packet pair measurement approach for network path capacity estimation. It addresses some drawbacks other approaches still bear. In contrast to...