similar to: broken link in documentation

void inverse_mdct_slow(float *buffer, int n) { =A0=A0 int i,j; =A0=A0 int n2 =3D n >> 1; =A0=A0 float *x =3D (float *) malloc(sizeof(*x) * n2); =A0=A0 memcpy(x, buffer, sizeof(*x) * n2); =A0=A0 for (i=3D0; i < n; ++i) { =A0=A0=A0=A0=A0 float acc =3D 0; =A0=A0=A0=A0=A0 for (j=3D0; j < n2; ++j) =A0=A0=A0=A0=A0=A0=A0=A0 // formula from paper: =A0=A0=A0=A0=A0=A0=A0=A0 //acc +=3D n/4.0f *

Hi The inverse MDCT formula seems to be missing from the vorbis specification. From reading the source code of stb_vorbis (http://nothings.org/stb_vorbis/) I've a good idea of what it might be, but cannot find the formula anywhere in the official specification (the one on http://xiph.org/vorbis/doc/Vorbis_I_spec.html ). I also understand that the formula stated in the eusipco_corrected.ps

Hi On http://www.xiph.org/ogg/vorbis/doc/vorbis-spec-intro.html there is a link to a document titled 'The use of multirate filter banks for coding of high quality digital audio' that explains window functions for iMDCT. I would very much like to read that document, but the link is broken. If someone would send me the document or a working link to it, I would be very happy. Thanks in

Hello, I want to let you know about an algo that will soon be published and that may be of interest to Vorbis (and other Ogg projects) : http://f-cpu.seul.org/whygee/ddj-3r/ddj-3r.tgz this is the archive of the article i submitted. It describes the "Recursive Range Reduction" algorithm (3R for short) and uses only a few basic computer principles (a binary tree being the most complex

Sorry for starting another topic, this is actually a reply to Segher's post on Sun Oct 22 on the 'mdct question' topic. I wasn't subscribed properly and so I didn't get email confirmation and thus can't add to that thread. So Segher, if the equation is indeed what you say it is, then replacing mdct_backward with this version should work, but it doesn't. Am I applying

Hello, Normally, in addition to such qdisc scheduler mechanisms as FIFO, PQ, WRR, WFQ, are there any more? Then, there is a confusion on scheduler in Linux enviroment: Assume there is a qdisc, such as RED as a leaf qdisc in a router, we know, if there is packet which want to enqueue the packet, the Function red_enqueue is called, but when the packet leave the queue(when the Function red_dequeue

I'm using an SVM as I've seen a paper that reported extremely good results. I'm not having such luck. I'm also interested in ideas for other approaches to the problem that can also be applied to general problems (no assuming that we're looking for spirals). Here is my code: library(mlbench) library(e1071) raw <- mlbench.spirals(194, 2) spiral <-

Hi, For those interested in reading more on CELT, here's another paper that just got accepted. That one focuses on the low-complexity mode and is based on 0.5.1. J.-M. Valin, T. B. Terriberry, G. Maxwell, A Full-Bandwidth Audio Codec with Low Complexity and Very Low Delay, Accepted for EUSIPCO 2009. http://people.xiph.org/~jm/papers/celt_eusipco2009.pdf Cheers, Jean-Marc

> Dear R Helpers! > > bgtest{lmtest} performs the Breusch-Godfrey test for higher > order serial > correlation. > > Is the Higher Order Correlation function already programmed in > R I couldn't find it? > > Sergei Petrov > ?acf ?pacf HTH, Bernhard ---------------------------------------------------------------------- If you have received this e-mail

Hi I'm a B.E student pursuing my Project in the CEERI unit of the Council of Scientific and Industrial Research, Chennai, TN, India. I'm working on R -Language for my project. I'm in need of the functionality of SIMCA for the project. Is there any in-built function for SIMCA in R? Or are there people working on it? It would be a great help if you let us know as soon as possible.

On Nov 5, 2007, at 2:55 AM, Pekka Jääskeläinen wrote: > Hello LLVM people, > > Our customizable TTA target [1] is capable of having plenty of > registers > and register file ports to improve instruction level parallelism and > reduce spills. It's totally up to the designer of the particular TTA > processor how much the processor has registers and register file >

Hi to all of vorbis developers! I think it is time to do core optimizations to vorbis-coder/decoder in asm. I`d like to help. What you think about that?

Hi to all of vorbis developers! I think it is time to do core optimizations to vorbis-coder/decoder in asm. I`d like to help. What you think about that?

Is there a document describing the guts of SCEV anywhere? I have a simple question. When looking at a linear SCEVAddRecExpr with a constant step recurrence (that is, getStepRecurrence returns SCEVConstant), is the constant in terms of bytes or in terms of "index," in that the byte offset is calculated by taking the step and multiplying it by the data size of any memory operation its

Gordon Henriksen wrote: > Can you be more specific the algorithm for which you need type > metadata in a write barrier? No algorithms I am aware of perform any > tracing from a write barrier. > This one does: http://citeseer.ist.psu.edu/cache/papers/cs2/442/http:zSzzSzwww.cs.technion.ac.ilzSz~erezzSzPaperszSzms-sliding-views.pdf/an-on-the-fly.pdf > Write barriers are

Hello there, apologies for cross-posting my question is not an S/R question but there is so much knowledge concentrated in those lists that I thought someone could point me in the right direction. A few months ago I read an article in a referenced journal comparing some data mining programs, among which there was Insightful's I Miner, SAS' Entreprise Miner, SPSS' Clementine (I think)

Chris Lattner wrote: > On Thu, 12 Apr 2007, Fernando Magno Quintao Pereira wrote: >>> I'm definitely interested in improving coalescing and it sounds like >>> this would fall under that work. Do you have references to papers >>> that talk about the various algorithms? >> Some suggestions: >> >> @InProceedings{Budimlic02, >> AUTHOR =

On Tue, 26 Jun 2007, [ISO-8859-1] Alberto González wrote: > The problem is that what i'm instrumenting is loads and stores, plus > function call arguments and return values, which have no signedness > information. Why do you need this? -Chris > El 26/06/2007, a las 17:03, Anton Korobeynikov escribió: > >> Hello, Alberto. >> >>> I'm using llvm for

>> As part of the advanced compilers course semester project (at >> UIUC), we >> are starting to implement array dependence analysis for LLVM. Great! This is something we've needed for a long time. > I'm currently working on a similar project and hoping to finish it in > about two weeks. Cool! I think the most critical part of this is to get a good

Full_Name: Nick Efthymiou Version: R1.5.0 and above OS: Red Hat Linux Submission from: (NULL) (162.93.14.73) With the introduction of the functions rowSums(), colSums(), rowMeans() and colMeans() in R1.5.0, function "SEXP do_colsum(SEXP call, SEXP op, SEXP args, SEXP rho)" was added to perform the fast summations. We have an excellent opportunity to improve the accuracy by