text stringlengths 8 23.4k | label int64 0 10 |
|---|---|
anisotropic reflection models james t. kajiya
| 6 |
corrigenda: "an extended set of fortran basic linear algebra subprograms" jack j. dongarra jeremy croz and sven hammarling and richard j. hanson
| 6 |
algorithm 677 _c_1 surface interpolation laura bacchelli montefusco giulio casciola
| 6 |
a remark on algorithm 644: "a portable package for bessel functions of a complex argument and nonnegative order" algorithm 644 computes all major bessel functions of a complex argument and of nonnegative order. single- precision routine cbesy and double-precision routine zbesy are modified to reduce the computation ti... | 6 |
fitting "standard" distributions to data is necessarily good: dogma or myth? this paper questions the conventional wisdom that "standard" distributions such as the normal, gamma, or beta families should necessarily be used to model inputs for simulation and proposes an alternative. relevant criteria are the quality of... | 6 |
on the computation of polynomial representations of nilpotent lie groups philip feinsilver uwe granz rene schott
| 6 |
remark on algorithm 716 the curve-fitting package tspack has been converted to double precision. also, portability has been improved by eliminating some potential errors. f. j. testa robert j. renka
| 6 |
real values of the w-function approximations for real values of w(x), where w is defined by solutions of w exp(w) = x, are presented. all of the approximations have maximum absolute (|w|>1) or relative (|w|<1) errors of o(10 4). with these approximations an efficient algorithm, consisting of a single iteration of a ra... | 6 |
can any stationary iteration using linear information be globally convergent? all known globally convergent iterations for the solution of a nonlinear operator equation (x) = 0 are either nonstationary or use nonlinear information. it is asked whether there exists a globally convergent stationary iteration which uses ... | 6 |
multicommodity flows in planar undirected graphs and shortest paths this paper deals with the multicommodity flow problems for two classes of planar undirected graphs. the first class c12 consists of graphs in which each source- sink pair is located on one of two specified face boundaries. the second class c01 consist... | 6 |
initializing generalized feedback shift register pseudorandom number generators the generalized feedback shift register pseudorandom number generators proposed by lewis and payne provide a very attractive method of random number generation. unfortunately, the published initialization procedure can be extremely time co... | 6 |
algorithm 722; functions to support the ieee standard for binary floating- point arithmetic this paper describes c programs for the support functions copysign(x,y), logb(x), scalb(x,n), nextafter(x,y), finite(x), and isnan(x) recommended in the appendix to the ieee standard for binary floating-point arithmetic. in the... | 6 |
when trees collide: an approximation algorithm for the generalized steiner problem on networks ajit agrawal philip klein r. ravi
| 6 |
graph coloring algorithms for fast evaluation of curtis decompositions marek perkowski rahul malvi stan grygiel mike burns alan mishchenko
| 6 |
a fast adaptive grid scheme for elliptic partial differential equations we describe the recursive subdivision (rs) method-an efficient and effective adaptive grid scheme for two-dimensional elliptic partial differential equations (pdes). the rs method generates a new grid by recursively subdividing a rectangular domai... | 6 |
the solution of almost block diagonal linear systems arising in spline collocation at gaussian points with monomial basis functions numerical techniques based on piecewise polynomial (that is, spline) collation at gaussian points are exceedingly effective for the approximate solution of boundary value problems, both f... | 6 |
algorithm 723; fresnel integrals an implementation of approximations for fresnel integrals and associated functions is described. the approximations were originally developed by w. j. cody, but a fortran implementation using them has not previously been published. w. van snyder
| 6 |
collocation software for second-order elliptic partial differential equations we consider the collocation method for linear, second-order elliptic problems on rectangular and general two-dimensional domains. an overview of the method is given for general domains, followed by a discussion of the improved efficiencies a... | 6 |
random behavior: mechanical and psychological foster lindley
| 6 |
better algorithms for unfair metrical task systems and applications amos fiat manor mendel
| 6 |
algorithm 706; dcutri: an algorithm for adaptive cubature over a collection of triangles an adaptive algorithm for computing an approximation to the integral of each element in a vector function f(x,y) over a two-dimensional region made up of triangles is presented. a fortran implementation of the algorithm is include... | 6 |
further algorithmic aspects of the local lemma michael molloy bruce reed
| 6 |
drawing compound digraphs and its application to an idea organizer (abstract) kozo sugiyama
| 6 |
the rectilinear steiner tree problem: algorithms and examples using permutations of the terminal set christine r. leverenz miroslaw truszczynski
| 6 |
sublinear time algorithms for metric space problems piotr indyk
| 6 |
fast pseudorandom generators for normal and exponential variates fast algorithms for generating pseudorandom numbers from the unit-normal and unit- exponential distributions are described. the methods are unusual in that they do not rely on a source of uniform random numbers, but generate the target distributions dire... | 6 |
algorithm 564: a test problem generator for discrete linear l1 approximation problem k. l. hoffman d. r. shier
| 6 |
algorithm 653: translation of algorithm 539: pc-blas, basic linear algebra subprograms for fortran usage with the intel 8087, 80287 numeric data processor r. j. hanson f. t. krogh
| 6 |
algorithm 690; chebyshev polynomial software for elliptic-parabolic systems of pdes pdecheb is a fortran 77 software package that semidiscretizes a wide range of time-dependent partial differential equations in one space variable. the software implements a family of spacial discretization formulas, based on piecewise ... | 6 |
automatic building of graphs for rectangular dualisation rectangular dualisation is a technique used to generate rectangular topologies for use in top-down floorplanning of integrated circuits. this paper presents an efficient algorithm that transforms an arbitrary graph, representing a custom integrated circuit, into... | 6 |
walsh-spectral test for gfsr pseudorandom numbers by applying weyl's criterion for k-distributivity to gfsr sequences, we derive a new theoretical test for investigating the statistical property of gfsr sequences. this test provides a very useful measure for examining the k-distribution, that is, the statistical indep... | 6 |
a reduced gradient algorithm for nonlinear network problems p. beck l. lasdon m. engquist
| 6 |
the efficient solution of linear complementarity problems for tridiagonal minkowski matrices c. w. cryer
| 6 |
best "ordering" for floating-point addition this correspondence examines the influence of the summation order on the numerical accuracy of the resulting sum when the addition is performed using floating-point, finite- precision arithmetic. a simple statistical model is used to find the relative performance of various ... | 6 |
a new proof of hilbert's theorem on homogeneous functions paul gordan
| 6 |
inverse pairs of test matrices algorithms that are readily programmable are provided for constructing inverse pairs of matrices with elements in a field, a division ring, or a ring. wilhelm s. ericksen
| 6 |
an adaptive mesh-moving and local refinement method for time-dependent partial differential equations we discuss mesh-moving, static mesh- regeneration, and local mesh-refinement algorithms that can be used with a finite difference or finite element scheme to solve initial-boundary value problems for vector systems of... | 6 |
factoring a binary polynomial of degree over one million on 22 may 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field z2 was completed on a 4-processor linux pc, using roughly 100 cpu-hours. the basic approach is a combination of the factorization software bipolar and a paral... | 6 |
remark on algorithm 751 the triangulation package tripack has been revised to run more efficiently and to eliminate some potential errors. also, a portable triangulation plotting routine was added. robert j. renka
| 6 |
fast evaluation of elementary mathematical functions with correctly rounded last bit abraham ziv
| 6 |
timing comparisons of the householder qr transformations with rank-1 and rank-2 updates timothy j. rolfe
| 6 |
figures of merit m. tompa
| 6 |
make it practical isao sasano zhenjiang hu masato takeichi mizuhito ogawa
| 6 |
generating multivariate distributions for statistical applications methods for generating random vectors from multi- variate distributions are required in a variety of statistical research contexts. examples of topics include examination of the robustness of multivariate tests such as roy's largest root test, assessme... | 6 |
using the sledge package on sturm-liouville problems having nonempty essential spectra we describe the performance of the sturm-liouville software package sledge on a variety of problems having continuous spectra. the code's output is shown to be in good accord with a wide range of known theoretical results. michael ... | 6 |
remark on algorithm 620 dennis e. hamilton
| 6 |
improving bipartite graphs using multi-strategy simulated annealing panagiotis k. linos michael breen
| 6 |
naomi one: north american openmath initiative goes online the north american openmath initiative (naomi) is a recently formed organization to promote, develop, and implement the openmath standard in north america. naomi held its first workshop in vancouver this february, and launched full-scale operations. stephen p. b... | 6 |
you could learn a lot from a quadratic: ii: digital dentistry henry g. baker
| 6 |
a note on the recursive calculation of incomplete gamma functions it is known that the recurrence relation for incomplete gamma functions {γ(a \\+ n, x)}, 0 ≤ a < 1, n = 0, 1, 2 ..., when x is positive, is unstable---more so the larger x. nevertheless, the recursion can be used in the range 0 ≤ n ≤ x practically witho... | 6 |
algebraic methods in the theory of lower bounds for boolean circuit complexity we use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fan-in circuits with the given set of basic operations. in particular, we prove that depth k circuits with gates not, or an... | 6 |
on the storage requirement in the out-of-core multifrontal method for sparse factorization two techniques are introduced to reduce the working storage requirement for the recent multifrontal method of duff and reid used in the sparse out-of-core factorization of symmetric matrices. for a given core size, the reduction... | 6 |
on the expected behavior of disjoint set union algorithms we show that the expected time of the weighted quickfind (qfw) disjoint set union and find algorithm to perform (n - 1) randomly chosen unions is cn + o(n/log n), where c = 2.0847 …. this implies, through an observation of tarjan and van leeuwen, linear expecte... | 6 |
a quadratic-tensor model algorithm for nonlinear least-squares problems with linear constraints a new algorithm is presented for solving nonlinear least-squares and nonlinear equation problems. the algorithm is based on approximating the nonlinear functions using the quadratic-tensor model proposed by schnabel and fra... | 6 |
reliable solution of special event location problems for odes computing the solution of the initial value problem in ordinary differential equations (odes) may be only part of a larger task. one such task is finding where an algebraic function of the solution (an event function) has a root (an event occurs). this is a... | 6 |
fast backtracking principles applied to find new cages brendan mckay wendy myrvold jacqueline nadon
| 6 |
l1 solution of overdetermined systems of linear equations nabih n. abdelmalek
| 6 |
performance evaluation of programs related to the real gamma function methods are presented for evaluating the performance of programs for the functions Γ(x), ln Γ(x), and (x). accuracy estimates are based on comparisons using the manipulation theorem. ideas for checking robustness are also given, and details on speci... | 6 |
optimal starting approximation and iterative algorithm for inverse error function bogdan a. popov
| 6 |
semi-membership algorithms: some recent advances derek denny-brown yenjo han lane a. hemaspaandra leen torenvliet
| 6 |
experimental analysis of dynamic algorithms for the single daniele frigioni mario ioffreda umberto nanni giulio pasquale
| 6 |
linear recurrences with carry as uniform random number generators raymond couture pierre l'ecuyer
| 6 |
a modified adams method for nonstiff and mildly stiff initial value problems adams predictor-corrector methods, and explicit runge--kutta formulas, have been widely used for the numerical solution of nonstiff initial value problems. both of these classes of methods have certain drawbacks, however, and it has long been... | 6 |
the numerical solution of separably stiff systems by precise partitioning david s. watkins ralph w. hansonsmith
| 6 |
another alternative for bordered systems william knight
| 6 |
table-driven implementation of the exponential function in ieee floating-point arithmetic algorithms and implementation details for the exponential function in both single- and double-precision of ieee 754 arithmetic are presented here. with a table of moderate size, the implementations need only working-precision ari... | 6 |
an algorithm for building rectangular floor-plans previous reports [1, 3] have shown how to build an optimal floor-plan assembly starting with a planar structure graph in terms of components and their connections. the existing methods are based on exhaustively inspecting all possible rectangular duals until an optimal... | 6 |
robust rational function approximation algorithm for model generation carlos p. coelho joel r. phillips l. miguel silveira
| 6 |
random number generators are chaotic c. herring j. i. palmore
| 6 |
the nearest polynomial with a given zero, and similar problems hans j. stetter
| 6 |
an extensible differential equation solver we describe a method for solving linear second order differential equations in terms of hypergeometric and other (less well known) special functions. intended as a method for computer algebra systems, the solver described in this article uses a database of functions to constru... | 6 |
random matroids we introduce a new random structure generalizing matroids. these random matroids allow us to develop general techniques for solving hard combinatorial optimization problems with random inputs. john h. reif paul g. spirakis
| 6 |
resistance scaling and random walk dimensions for finitely ramified sierpinski carpets christian schulzky astrid franz karl heinz hoffmann
| 6 |
non-blocking networks p feldman j friedman n pippenger
| 6 |
expressing combinatorial optimization problems by linear programs mihalis yannakakis
| 6 |
implementing gauss jordan on a hypercube multicomputer we consider the solution of dense algebraic systems on the ncube hypercube via the gauss jordan method. advanced loop interchange techniques are used to determine the appropriate algorithm for mimd architectures. for a computer with p = n processors, we show that ... | 6 |
evaluation and inversion of the ratios of modified bessel functions, _i_1(_x_) /_i_0 (_x_) and _i_ 1.5(_x_)/ _i_0.5(_x_) geoffrey w. hill
| 6 |
a mathematical programming generator this paper describes a mathematical programming generator that interprets problem statements written in the algebraic notation found in journal articles and text-books and outputs statements in the _mps_ format used by ibm's _mpsx_ mathematical programming system. the system has bee... | 6 |
on the second eigenvalue of random regular graphs j. friedman j. kahn e. szemeredi
| 6 |
editorial: a publishing plan fulfilled t. r. girill
| 6 |
a survey of linear programming in randomized subexponential time michael goldwasser
| 6 |
an implementation of a class of stabilized explicit methods for the time integration of parabolic equations j. g. verwer
| 6 |
the conjugate gradient method in the presence of clustered eigenvalues jose d. flores
| 6 |
optimal quadratures in h(sub)p spaces k. sikorski f. stenger
| 6 |
a set of library routines for solving parabolic equations in one space variable p. m. dew j. e. walsh
| 6 |
astrogeometry, error estimation, and other applications of set-valued analysis andrei finkelstein olga kosheleva vladik kreinovich
| 6 |
bayesian networks this brief tutorial on bayesian networks serves to introduce readers to some of the concepts, terminology, and notation employed by articles in this special section. in a bayesian network, a variable takes on values from a collection of mutually exclusive and collective exhaustive states. a variable ... | 6 |
suitening our nomenclature l. ramshaw
| 6 |
parint: a software package for parallel integration e. dedoncker a. gupta j. ball p. ealy alan genz
| 6 |
algorithm 724; program to calculate f-percentiles let 0 p 1 be given and let f be the cumulative distribution function of the f-distribution with (m, n,) degrees of freedom. this fortran 77 routine is a complement to [1] where a method was presented to find the inverse of the f-distribution function, finv(m, n, p), us... | 6 |
the solution of a combustion problem with rosenbrock methods solving flame propagation problems with the method of lines leads to large systems of ordinary differential equations. these systems are usually solved by backward differentiation formula (bdf) methods, such as by lsode of hindmarsh. recently, rosenbrock met... | 6 |
time- and space-optimality in b-trees a b-tree is compact if it is minimal in number of nodes, hence has optimal space utilization, among equally capacious b-trees of the same order. the space utilization of compact b-trees is analyzed and compared with that of noncompact b-trees and with (node)-visit-optimal b-trees,... | 6 |
algorithm 549: weierstrass' elliptic functions [s21] ulrich eckhardt
| 6 |
construction of nilpotent lie algebras over arbitrary fields in this paper we present a general description of a computationally efficient algorithm for constructing every n-dimensional nilpotent lie algebra as a central extension of a nilpotent lie algebra of dimension less than n. as an application of the algorithm... | 6 |
intrinsically parallel multiscale algorithms for hypercubes most algorithms implemented on parallel computers have been optimal serial algorithms, slightly modified or parallelized. an exciting possibility is the search for intrinsically parallel algorithms. these are algorithms which do not have a sensible serial equ... | 6 |
local error estimates and regularity tests for the implementation of double adaptive quadrature paola favati giuseppe fiorentino grazia lotti francesco romani
| 6 |
variable precision exponential functionthe exponential function presented here returns a result which differs from_ex_ by less than one unit in the last place, for any representable value of_x_ which is not too close to values for which _ex_ would overflow orunderflow. (for values of _x_ which are not within this range... | 6 |
stiffness detection and estimation of dominant spectrum with explicit runge- kutta methods a new stiffness detection scheme based on explicit runge-kutta methods is proposed. it uses a krylov subspace approximation to estimate the eigenvalues of the jacobian of the differential system. the numerical examples indicate ... | 6 |
stochastic bounds for queueing systems with multiple markov modulated sources zhen liu don towsley
| 6 |
a mixed integer mathematical programming model solution using branch and bound techniques (abstract only) an optimal allocation of work release and labor assignments on a paced assembly line using the objective criterion of minimal standard hours has been formulated as a mixed integer mathematical programming model. t... | 6 |
End of preview. Expand in Data Studio
Dataset used in the paper:
A thorough benchmark of automatic text classification From traditional approaches to large language models
https://github.com/waashk/atcBench
To guarantee the reproducibility of the obtained results, the dataset and its respective CV train-test partitions is available here.
Each dataset contains the following files:
- data.parquet: pandas DataFrame with texts and associated encoded labels for each document.
- split_<k>.pkl: pandas DataFrame with k-cross validation partition.
- For each fold <k>:
- train_fold_<k>.parquet: pandas DataFrame with texts and associated encoded labels for each document on the training split k (according to split_<k>.pkl)
- train_fold_<k>.parquet: pandas DataFrame with texts and associated encoded labels for each document on the testing split k (according to split_<k>.pkl)
- Downloads last month
- 4