Displaying 4 results from an estimated 4 matches for "muich".
Did you mean:
much
2002 Dec 21
4
had a thought on peeling last night
...-1 belong to q5.53" all the way down to "all those bits of data not in q10 to q-0.99 belong to q-1".
eventually i'm guessing you would end up with a vorbis file with all the quantifiable samples & bits of data marked for peeling, making the job theoretically much easier & muich more accurate even with peelable streaming.
I didn't think it much further than that, cos i'm not a programming genius like everyone else on here, i just think a lot.
<p>--- >8 ----
List archives: http://www.xiph.org/archives/
Ogg project homepage: http://www.xiph.org/ogg/
To un...
2009 Dec 17
3
[LLVMdev] AVX Shuffles & PatLeaf Help Needed
On Thursday 17 December 2009 17:16, Nate Begeman wrote:
> David, this is probably the wrong approach, based on the accreted awfulness
> of the X86 shuffle lowering code,
Ha! I have no issue believing this statement. :)
> The correct approach is probably a rewrite based around what
> AltiVec does: Canonicalize to byte ops, and write all the patterns once
> rather than having to
2006 Sep 11
95
Proposal: multiple copies of user data
Here is a proposal for a new ''copies'' property which would allow
different levels of replication for different filesystems.
Your comments are appreciated!
--matt
A. INTRODUCTION
ZFS stores multiple copies of all metadata. This is accomplished by
storing up to three DVAs (Disk Virtual Addresses) in each block pointer.
This feature is known as "Ditto Blocks". When
2006 Sep 11
95
Proposal: multiple copies of user data
Here is a proposal for a new ''copies'' property which would allow
different levels of replication for different filesystems.
Your comments are appreciated!
--matt
A. INTRODUCTION
ZFS stores multiple copies of all metadata. This is accomplished by
storing up to three DVAs (Disk Virtual Addresses) in each block pointer.
This feature is known as "Ditto Blocks". When