Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.compression

comp.compression

16012 articles (numbers 115 – 16289) — threaded view

| Advanced

Subject Author Date [asc]
Re: sign patterns "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-20 17:29 +0300
Re: Binomial distribution related Thomas Richter <thor@math.tu-berlin.de> 2011-07-20 17:43 +0200
Re: sign patterns Thomas Richter <thor@math.tu-berlin.de> 2011-07-20 17:51 +0200
Re: sign patterns Thomas Richter <thor@math.tu-berlin.de> 2011-07-20 17:56 +0200
Re: unpacking .z files glen herrmannsfeldt <gah@ugcs.caltech.edu> 2011-07-20 16:39 +0000
Re: sign patterns "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-20 23:46 +0300
Re: sign patterns Thomas Richter <thor@math.tu-berlin.de> 2011-07-20 23:08 +0200
Re: sign patterns "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-21 00:30 +0300
Re: sign patterns "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-21 01:00 +0300
Re: sign patterns "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-21 04:25 +0300
Re: sign patterns "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-21 09:15 +0300
Re: sign patterns Thomas Richter <thor@math.tu-berlin.de> 2011-07-21 10:08 +0200
Re: sign patterns Thomas Richter <thor@math.tu-berlin.de> 2011-07-21 10:24 +0200
1D 16p intDCT-II code wanted "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-21 22:07 +0300
Re: 1D 16p intDCT-II code wanted Sebastian <s.gesemann@gmail.com> 2011-07-22 04:30 -0700
Re: 1D 16p intDCT-II code wanted "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-22 15:07 +0300
Re: unpacking .z files Mark Adler <madler@alumni.caltech.edu> 2011-07-22 22:09 -0700
Re: Binomial distribution related "filia&sofia" <in_tyrannos@hotmail.com> 2011-07-23 05:42 -0700
Re: Binomial distribution related "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-23 22:42 +0300
Re: Binomial distribution related Thomas Richter <thor@math.tu-berlin.de> 2011-07-23 22:15 +0200
Re: Binomial distribution related "filia&sofia" <in_tyrannos@hotmail.com> 2011-07-24 07:46 -0700
Re: Binomial distribution related Thomas Richter <thor@math.tu-berlin.de> 2011-07-24 23:38 +0200
PSD to XHTML Conversion Services and PSD to HTML CSS Conversion Services, PSD to Joomla, Drupal, Wordpress Conversion xhtml champs <xhtmlchamps143@gmail.com> 2011-07-26 03:20 -0700
Re: sign patterns "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-26 23:02 +0300
Re: sign patterns "Captain Obvious" <udodenko@users.sourceforge.net> 2011-07-26 23:19 +0300
Re: sign patterns Thomas Richter <thor@math.tu-berlin.de> 2011-07-27 21:54 +0200
Re: sign patterns Thomas Richter <thor@math.tu-berlin.de> 2011-07-27 22:18 +0200
Re: unpacking .z files sblinkhorn <steve@prd.co.uk> 2011-07-28 11:15 -0700
Re: unpacking .z files sblinkhorn <steve@prd.co.uk> 2011-07-29 02:53 -0700
Re: Bitstream compression Noob <root@127.0.0.1> 2011-07-29 16:36 +0200
Re: Bitstream compression Noob <root@127.0.0.1> 2011-07-29 16:48 +0200
Re: unpacking .z files Mark Adler <madler@alumni.caltech.edu> 2011-07-29 08:21 -0700
Re: unpacking .z files Mark Adler <madler@alumni.caltech.edu> 2011-07-31 08:21 -0700
Re: Bitstream compression Rob Gaddi <rgaddi@technologyhighland.com> 2011-08-01 09:24 -0700
looking for preprocess alg. (before compression) Sergio Artic <sergio.artic@gmail.com> 2011-08-05 14:11 +0200
AC 2011 (Rio de Janeiro, Brazil) - last call for submission: 5 September 2011 "natty2006@gmail.com" <natty2006@gmail.com> 2011-08-12 03:30 -0700
ICWI 2011 (Rio de Janeiro, Brazil): last call for submission: 5 September 2011 "natty2006@gmail.com" <natty2006@gmail.com> 2011-08-12 03:31 -0700
Gregory Chaitin's Famous Omega explicit implies only 1 in Million'th of Numbers of specific ( large enough ) length CAN BE COMPRESSABLE LawCounsels <LawCounsels@aol.com> 2011-08-18 10:40 -0700
Re: Gregory Chaitin's Famous Omega explicit implies only 1 in Million'th of Numbers of specific ( large enough ) length CAN BE COMPRESSABLE Jim Leonard <mobygamer@gmail.com> 2011-08-18 11:14 -0700
Re: Gregory Chaitin's Famous Omega explicit implies only 1 in Million'th of Numbers of specific ( large enough ) length CAN BE COMPRESSABLE LawCounsels <LawCounsels@aol.com> 2011-08-19 02:33 -0700
Re: Gregory Chaitin's Famous Omega explicit implies only 1 in Million'th of Numbers of specific ( large enough ) length CAN BE COMPRESSABLE biject <biject.bwts@gmail.com> 2011-08-19 07:46 -0700
Re: Gregory Chaitin's Famous Omega explicit implies only 1 in Million'th of Numbers of specific ( large enough ) length CAN BE COMPRESSABLE LawCounsels <LawCounsels@aol.com> 2011-08-19 10:03 -0700
Re: Gregory Chaitin's Famous Omega explicit implies only 1 in Million'th of Numbers of specific ( large enough ) length CAN BE COMPRESSABLE Thomas Richter <thor@math.tu-berlin.de> 2011-08-19 21:37 +0200
Re: Gregory Chaitin's Famous Omega explicit implies only 1 in Million'th of Numbers of specific ( large enough ) length CAN BE COMPRESSABLE Thomas Richter <thor@math.tu-berlin.de> 2011-08-19 21:45 +0200
Re: Gregory Chaitin's Famous Omega explicit implies only 1 in Million'th of Numbers of specific ( large enough ) length CAN BE COMPRESSABLE "George Johnson" <matrix29@charter.net> 2011-08-20 00:22 -0400
Re: Gregory Chaitin's Famous Omega explicit implies only 1 in Million'th of Numbers of specific ( large enough ) length CAN BE COMPRESSABLE "George Johnson" <matrix29@charter.net> 2011-08-20 00:24 -0400
Re: Gregory Chaitin's Famous Omega explicit implies only 1 in Million'th of Numbers of specific ( large enough ) length CAN BE COMPRESSABLE "George Johnson" <matrix29@charter.net> 2011-08-20 05:43 -0400

« Previous 1 ... 315 316 317 318 319 ... 321 Next »


csiph-web