search for: citeseerx

...king transformation. Thank you for the comment! Could you please advise me where I can find definitions of array expansion and storage mapping optimization? I've found the following papers that are probably related to this: [1] and [2]. However, maybe I missed something. Refs.: [1] - http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.29.5704&rep=rep1&type=pdf [2] - https://hal.archives-ouvertes.fr/hal-01257316/document -- Cheers, Roman Gareev.

...or the comment! Could you please advise me where I can find > definitions of array expansion and storage mapping optimization? > > I've found the following papers that are probably related to this: [1] > and [2]. However, maybe I missed something. > > Refs.: > [1] - http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.29.5704&rep=rep1&type=pdf Yes, this is one of the must-read papers for any polyhedral compilation work! The following is a generalization to approximate array dataflow (journal extension of a POPL 1998 paper) http://citeseerx.ist.psu.edu/viewdoc/do...

...t's correct. > What are these sophisticated techniques you are talking about? My time > frame for implementing this is, not unlimited, but fairly long. Less > than a year (of spare time) would be ok. I still need to feel > progress. > > I'm talking about this: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9083 I don't know how difficult it would be to implement it in LLVM's codegen. Nicolas

...urization, and do the rest (including loop restructuring) after it. This is not mentioned in the proposal (we tried to be succint -- only 20 pages long! :-)), but explained in detail in [Tian05] (sorry, the link in the proposal doesn't lead you directly to pdf file; use this one instead: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.97.3763&rep=rep1&type=pdf). Yours, Andrey

Hello everyone, I wanted to ask if there is an R-package to fit the following Poisson regression model log(\lambda_{ijk}) = \phi_{i} + \alpha_{j} + \beta_{k} i=1,\cdots,N (subjects) j=0,1 (two levels) k=0,1 (two levels) treating the \phi_{i} as nuinsance parameters. Thank you very much -- -Tony [[alternative HTML version deleted]]

...turing) after it. This is not > > mentioned in the proposal (we tried to be succint -- only 20 pages > > long! :-)), but explained in detail in [Tian05] (sorry, the link in > > the proposal doesn't lead you directly to pdf file; use this one > > instead: > > http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.97.3763&rep=rep1&type=pdf). > > With regard to what you're proposing, the paper actually leaves a lot > unexplained. The optimizations that it discusses prior to OpenMP > lowering seem to be, "classical peephole optimizations wit...

...t (including loop restructuring) after it. This is not > mentioned in the proposal (we tried to be succint -- only 20 pages > long! :-)), but explained in detail in [Tian05] (sorry, the link in > the proposal doesn't lead you directly to pdf file; use this one > instead: > http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.97.3763&rep=rep1&type=pdf). With regard to what you're proposing, the paper actually leaves a lot unexplained. The optimizations that it discusses prior to OpenMP lowering seem to be, "classical peephole optimizations within basic-blocks&quo...

...is is not >> > mentioned in the proposal (we tried to be succint -- only 20 pages >> > long! :-)), but explained in detail in [Tian05] (sorry, the link in >> > the proposal doesn't lead you directly to pdf file; use this one >> > instead: >> > http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.97.3763&rep=rep1&type=pdf). >> >> With regard to what you're proposing, the paper actually leaves a lot >> unexplained. The optimizations that it discusses prior to OpenMP >> lowering seem to be, "classical peephole op...

On Tue, May 19, 2009 at 12:30 PM, Nicolas Geoffray <nicolas.geoffray at lip6.fr> wrote: >> The pi functions can be implemented with copy instructions. > > Store instructions? I would assume something more like "select i1 true, <ty> %val, <ty> undef". -Eli

The curve() function plots an expression in x over an interval [from,to]. I am looking for a function that would allow me to plot a parametrized curve t -> x(t) where x is a vector in 2 or 3 dimensions. For example (cos(t), sin(t)) (a2D  circle) or (cos(t), sin(t), t) (a 3D helix). It seems that neither curve(), plot(), nor persp() are helpful for that particular problem. I bet I?m not the

Hi Alberto, I have not used this myself, but I think you should be able to visit your Instruction ‘users()’. I think the name this function was given is a bit confusing, but this returns an iterator range you can iterate through to find instructions that depend on a given one. Similarly, you have the function ‘uses()’ that can be used to traverse down the DAG when instructions are still on SSA

Dear all, I am currently looking for a book about support vector machines for regression and classification and am a bit lost since they are plenty of books dealing with this subject. I am not totally new to the field and would like to get more information on that subject for later use with the e1071 <http://cran.r-project.org/web/packages/e1071/index.html> package for instance. Does

Andrey Bokhanko <andreybokhanko at gmail.com> writes: > There are three ways to make this work correctly: > > 1) Ignore OpenMP-related intrinsics and associated metadata. Least > effort, least benefit (no OpenMP support). Yet, OpenMP programs > compiled correctly, as if no pragmas are present -- including *exactly > the same* number of routines and call graph (thanks to no

On Tuesday 16 June 2009 15:44:04 Aaron Gray wrote: > Jon Harrop wrote: > >Even if this puts LLVM at an unfair disadvantage, I think you will find > >that > >LLVM will thrash MLton's current x86 backend anyway. > > > >I did some benchmarking on HLVM and found that it was often several times > >faster than OCaml when the GC is not the bottleneck: > >

Hi Nicolas, On Tue, Mar 3, 2009 at 11:38 AM, Nicolas Geoffray <nicolas.geoffray at lip6.fr> wrote: > > Duncan Sands wrote: >> >> Another possibility, very close you yours and currently used by the vmkit >> project, is to modify all functions so they return two values, the usual >> return value and an additional boolean value indicating whether an >>

R factors are the natural way to represent factors -- and should be efficient since they use small integers. But in fact, for many (but not all) operations, R factors are considerably slower than integers, or even character strings. This appears to be because whenever a factor vector is subsetted, the entire levels vector is copied. For example: > i1 <- sample(1e4,1e6,replace=T) > c1

>On Sunday 14 June 2009 14:09:33 Wesley W. Terpstra wrote: >> On Sun, Jun 14, 2009 at 10:50 AM, Florian Weimer<fw at deneb.enyo.de> wrote: >> > Is this really a problem for MLton? I think you only get less precise >> > alias analysis, and that's it. >> >> Correct. However, I want a fair comparison between LLVM performance >> and the native x86

I?ve been using Frank Harrell?s rms package to do bootstrap model validation. Is it the case that the optimum penalization may still give a model which is substantially overfitted? I calculated corrected R^2, optimism in R^2, and corrected slope for various penalties for a simple example: x1 <- rnorm(45) x2 <- rnorm(45) x3 <- rnorm(45) y <- x1 + 2*x2 + rnorm(45,0,3) ols0 <- ols(y

Hi, I'm not able to answer your question. I'm wondering if you can create your own if it is just your own hobby project, or a project that you don't have to commit to the main repository. Creating DominatorFrontier seems to be expensive. However, if you are using bit-vector to represent a basic-block-set, I guess it can be done in linear time in practice. Following is the

2015-09-20 14:21 UTC+02:00, Patrick Masotta via Syslinux <syslinux at zytor.com>: >>>> > > This is related to bug #37. > > http://bugzilla.syslinux.org/show_bug.cgi?id=37 > > > > Actually, I think this raises a more general issue about the source > > code organization. Most of the code of syslinux has been developped in > > a time where