Results 1  10
of
1,203,243
Gradientbased learning applied to document recognition
 Proceedings of the IEEE
, 1998
"... Multilayer neural networks trained with the backpropagation algorithm constitute the best example of a successful gradientbased learning technique. Given an appropriate network architecture, gradientbased learning algorithms can be used to synthesize a complex decision surface that can classify hi ..."
Abstract

Cited by 1524 (83 self)
 Add to MetaCart
to deal with the variability of two dimensional (2D) shapes, are shown to outperform all other techniques. Reallife document recognition systems are composed of multiple modules including field extraction, segmentation, recognition, and language modeling. A new learning paradigm, called graph
ddimensional Hyperbolic Surfaces
"... Abstract. We present a new algorithm for reliable pointlocation problem in a system of ddimensional hyperbolic surfaces. The problem is perpetual to many applications, including modeling of a molecular system represented as a set of polydisperse spheres through the use of the Euclidean ddimensiona ..."
Abstract
 Add to MetaCart
Abstract. We present a new algorithm for reliable pointlocation problem in a system of ddimensional hyperbolic surfaces. The problem is perpetual to many applications, including modeling of a molecular system represented as a set of polydisperse spheres through the use of the Euclidean ddimensional
1 Stochastic parallel transport on the ddimensional Torus
"... In Ref. 2 V. Arnold has shown that the Euler flow can be identified with a geodesic on the group G of volume preserving diffeomorphisms with respect to the L2 metric. Following this approach, the geometry of G plays a fundamental role in hydrodynamics and is important for instance in the study of th ..."
Abstract
 Add to MetaCart
of the stability of the fluids motion. It has been developed by many authors, one of the first being Ref. 5, see also Ref. 3 and references therein. In this paper we consider the ddimensional torus as the underlying manifold, we compute the constants of structure and the Christoffel symbols of the corresponding
On Spherically Symmetric Solutions In DDimensional Dilaton Gravity
, 1995
"... Exact static, spherically symmetric solutions to the EinsteinAbelian gaugedilaton equations, in Ddimensional gravity with a chain of n Ricciflat internal spaces are considered, with the gauge field potential having three nonzero components: the temporal, Coulomblike one, the one pointing to on ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Exact static, spherically symmetric solutions to the EinsteinAbelian gaugedilaton equations, in Ddimensional gravity with a chain of n Ricciflat internal spaces are considered, with the gauge field potential having three nonzero components: the temporal, Coulomblike one, the one pointing
by a periodic potential: a ddimensional solution.
, 1996
"... Depinning transition of a directed polymer ..."
On the Complexity of Protein Folding
 Journal of Computational Biology
"... We show that the protein folding problem in the twodimensional HP model is NPcomplete. 1 Introduction Proteins are polymer chains consisting of monomers of twenty different kinds. Much of the genetic information in the DNA contains the sequence information of proteins, with three nucleotides enc ..."
Abstract

Cited by 122 (4 self)
 Add to MetaCart
We show that the protein folding problem in the twodimensional HP model is NPcomplete. 1 Introduction Proteins are polymer chains consisting of monomers of twenty different kinds. Much of the genetic information in the DNA contains the sequence information of proteins, with three nucleotides
Secret Sharing on the dDimensional Cube
, 2005
"... We prove that for d > 1 the information rate of the perfect secret sharing scheme based on the edge set of the ddimensional cube is exactly 2/d. ..."
Abstract
 Add to MetaCart
We prove that for d > 1 the information rate of the perfect secret sharing scheme based on the edge set of the ddimensional cube is exactly 2/d.
Analyticity of the DDimensional Bond Percolation Probability Around P = 1
"... Let (p) be the percolation probability of a ddimensional bond percolation process on . We prove that 1 (p) can be written as an absolutely convergent series in powers of (1 p)=p, provided that j(1 p)=pj is suciently small. This implies that (p) is an analytic function of the complex variable p ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Let (p) be the percolation probability of a ddimensional bond percolation process on . We prove that 1 (p) can be written as an absolutely convergent series in powers of (1 p)=p, provided that j(1 p)=pj is suciently small. This implies that (p) is an analytic function of the complex variable
Abstract Transport coefficients of ddimensional inelastic Maxwell models ⋆
, 2002
"... Due to the mathematical complexity of the Boltzmann equation for inelastic hard spheres, a kinetic model has recently been proposed whereby the collision rate (which is proportional to the relative velocity for hard spheres) is replaced by an average velocityindependent value. The resulting inelast ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Due to the mathematical complexity of the Boltzmann equation for inelastic hard spheres, a kinetic model has recently been proposed whereby the collision rate (which is proportional to the relative velocity for hard spheres) is replaced by an average velocityindependent value. The resulting
Results 1  10
of
1,203,243