search for: citeseer

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

...ough. I want a better fit. I think I can get one, I just don't know how. There's a paper on Proximal SVMs that claims a better result. To the best of my knowledge, PSVMs should not outperform SVMs, they are merely faster to compute. You can find the paper (with the picture of their SVM) on citeseer: http://citeseer.ifi.unizh.ch/cachedpage/515368/5 @misc{ fung-proximal, author = "G. Fung and O. Mangasarian", title = "Proximal support vector machine classifiers", text = "G. Fung and O. Mangasarian. Proximal support vector machine classifiers. In F. P. D. Lee a...

> 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

...; reuses registers only if it really has to (when it runs out of new > ones)? What you want is to remove anti-dependency before post-allocation scheduling. Alas, there is nothing in current LLVM implementation that deals with this. There are quite a few papers on this topic, e.g. http://citeseer.ist.psu.edu/calland97removal.html I am also very interested in this. Do you plan to contribute your work back to the community? :-) Evan > > I can understand that for many architectures without static > scheduling etc. > the "allocate registers sparingly"-approach is th...

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 commonly used to record references from old- > generation objects to new-generation ones, either by recording the > referencing object, the re...

...id Goldberg", title = "What Every Computer Scientist Should Know About Floating-Point Arithmetic", journal = "ACM Computing Surveys", volume = "23", number = "1", pages = "5--48", year = "1991", url = "citeseer.nj.nec.com/goldberg91what.html" } (http://citeseer.nj.nec.com/goldberg91what.html) and in the article "Floating-point Summation", by Evan Manning, in C/C++ User's Journal, Sept. 1996. The proposed improvement has been tested in !IEEE_754 mode, the patch is attached. It is int...

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.

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'm reading the doc at http://xiph.org/ogg/vorbis/doc/Vorbis_I_spec.html and the link to the paper http://www.iocon.com/resource/docs/ps/eusipco_corrected.ps doesn't work. Could anyone correct the link and/or mirror this paper ? Thanks, YG --- >8 ---- List archives: http://www.xiph.org/archives/ Ogg project homepage: http://www.xiph.org/ogg/ To unsubscribe from this list,

...bilities to do everything that you are trying to >re-implement. >2) Have you looked at the C backend? It recreates loops. It may not >create "for" loops but you can hack on it to do that. I wonder if you mean "goto elimination technique" by Ana Maria Erosa ( http://citeseer.ist.psu.edu/317208.html ) for this? >3) The way you are converting out of SSA is wrong. You will suffer >from lost copies. You should look at using demotePHI(). see include/ >llvm/Transforms/Utils/Local.h I use LLVM 1.9 where I can't find demotePHI(). Is it a function available at...

Hi, > Is there a document describing the guts of SCEV anywhere? If you're looking for theoretical background of SCEV (chains of recurrences algebra), you may take a look at this article: http://citeseer.ist.psu.edu/vanengelen00symbolic.html I'm not aware of any LLVM-specific document describing SCEV. > 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 b...

...rt text processing, text categorization, word sense disambiguation, text understanding etc. In particular, I would like to find a routine in R to perform "maximum entropy" classification. (Ref: Nigam,Lafferty,McCallum, "Using Maximum Entropy for Text Classification", http://citeseer.nj.nec.com/nigam99using.html) Thanks, John Day PhD Candidate Florida Tech Melbourne, FL -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[...

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

...ny suggestion on features, tests and/or interface are welcome. I'd suggest looking at: Using the chains of recurrences algebra for data dependence testing and induction variable substitution MS Thesis, Johnie Birch Array Data Dependence Testing with the Chains of Recurrences Algebra http://citeseer.ist.psu.edu/vanengelen04array.html An empirical evaluation of chains of recurrences for array dependence testing http://doi.acm.org/10.1145/1152154.1152198 etc. >> From my experience I can say it's essential to use a precise alias > analysis as the base for the array dependence an...

I'm using LLVM to instrument C code to test the efectiveness of some methods of error detection with dynamic invariants (see http:// citeseer.ist.psu.edu/hangal02tracking.html). I'm using also a range invariant (max an min values seen). The problem is that for those invariants, I need to know if the value is signed or not (0xFF can be -1 or 255, depending on signed/unsigned). Alberto El 26/06/2007, a las 18:22, Chris Lattner...

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)

Ralf, Ok, thanks, I'll have a look. The paper I was referencing was http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.668 from '90 I believe. There is also an Intel paper the expands on this for the Itanium. On Fri, Jan 6, 2012 at 12:34 PM, Ralf Karrenberg < karrenberg at cdl.uni-saarland.de> wrote: > Hi, > > I am not sure if I know the paper you menti...

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 =

...09-15, at 23:55, Talin wrote: > 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 commonly used to record references from old- >> generation objects to new-generation ones, either by recording the >...

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