1287 search results - page 12 / 258 » Self-Normalized Linear Tests |
STOC
1992
ACM
13 years 11 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
ISAAC
1995
Springer
13 years 11 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
QNS
1996
13 years 9 months ago
1996
In this paper we look at the developmentof ScaLAPACK, a software library for dense and banded numerical linear algebra, and the NAG Numerical PVM Library, which includes software ...
ENTCS
2006
13 years 7 months ago
2006
We build a realizability model for linear logic using a name-passing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and...
APPML
2004
13 years 7 months ago
2004
We introduce and discuss a linear Boltzmann equation describing dissipative interactions of a gas of test particles with a fixed background. For a pseudo-Maxwellian collision kern...