105 search results - page 19 / 21 » Tree Structure Compression with RePair |
IPSN
2009
Springer
15 years 4 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
IEEESCC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
PG
2002
IEEE
15 years 2 months ago
2002
IEEE
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
RECOMB
2009
Springer
15 years 10 months ago
2009
Springer
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
125
click to vote
CPM
2004
Springer
15 years 2 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...