38251

来自「神经网络昆斯林的新闻组分类2006」· 代码 · 共 29 行

TXT
29
字号
Newsgroups: comp.graphicsPath: cantaloupe.srv.cs.cmu.edu!crabapple.srv.cs.cmu.edu!bb3.andrew.cmu.edu!news.sei.cmu.edu!cis.ohio-state.edu!sample.eng.ohio-state.edu!purdue!mentor.cc.purdue.edu!newsFrom: ab@nova.cc.purdue.edu (Allen B)Subject: Re: Fractals? what good are they?Message-ID: <C5HJzA.JoH@mentor.cc.purdue.edu>Sender: news@mentor.cc.purdue.edu (USENET News)Organization: Purdue UniversityReferences: <7208@pdxgate.UUCP>Date: Wed, 14 Apr 1993 18:13:57 GMTLines: 17In article <7208@pdxgate.UUCP> idr@rigel.cs.pdx.edu (Ian D Romanick) writes:> They talked about another routine that could yield up to 150 to 1> compress with no image loss that *I* could notice.  The draw back is that it> takes a hell of a long time to compress something.  I'll have to see if I can> find the book so that I can give more exact numbers.  TTYL.That's a typical claim, though they say they've improvedcompression speed considerably.  Did you find out anything elseabout the book?  I'd be interested in looking at it if you could give meany pointers.Reportedly, early fractal compression times of 24-100 hours usedthat marvelous piece of hardware called "grad students" to do thework.  Supposedly it's been automated since about 1988, but I'm stillwaiting to be impressed.Allen B (Sign me "Cynical")

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?