Re: Two-dimensional pattern matching/compression
- From: "jacko" <jackokring@xxxxxxxxx>
- Date: 11 Jul 2006 10:46:43 -0700
all given prime number identifier
start with smallest
join to all of increasing size (if possible and give composite id
number)
delete the smallest when all joins tried with bigger
loop with next smallest until generated composite of all (id)
.
- Follow-Ups:
- Re: Two-dimensional pattern matching/compression
- From: Herbert Glarner
- Re: Two-dimensional pattern matching/compression
- From: jacko
- Re: Two-dimensional pattern matching/compression
- References:
- Re: Two-dimensional pattern matching/compression
- From: Herbert Glarner
- Two-dimensional pattern matching/compression
- From: Herbert Glarner
- Re: Two-dimensional pattern matching/compression
- From: neleai
- Re: Two-dimensional pattern matching/compression
- Prev by Date: Re: Can the humanity fix the universe bug?
- Next by Date: solving #SAT in poly(number of vars) and exp(number of clauses)?
- Previous by thread: Re: Two-dimensional pattern matching/compression
- Next by thread: Re: Two-dimensional pattern matching/compression
- Index(es):
Relevant Pages
|