Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...
Stefan Felsner, Peter C. Fishburn, William T. Trot...
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
mes, abstracts and year of publication of all 853 papers published.1 We then applied Porter stemming and stopword removal to this text, represented terms from the elds with twice t...
Alan F. Smeaton, Gary Keogh, Cathal Gurrin, Kieran...
— When performing dynamic studies using emission tomography the tracer distribution changes during acquisition of a single set of projections. This is particularly true for some ...
Chi-Hoi Lau, David Dagan Feng, Brian F. Hutton, Da...
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon