نتایج جستجو برای: accelerating techniques

تعداد نتایج: 647320  

Journal: :Physics Letters B 2022

In recent work we have extended the theory that dark matter is composed of primordial black hole (PBHs) to extremely high masses and made an assumption holographic entropy bound saturated. Astrophysicists recently suggested PBHs are formed with electric charges Q, retain their for age universe, all same sign, Q/M increases mass M. Adopting these assumptions using approximate formula relating Q ...

Journal: :Innovations: Technology, Governance, Globalization 2013

Journal: :Games 2015
Andrew M. Colman Briony D. Pulford

Game theory has focused attention on different problems at different times in its history. Currently, attention is devoted to investigating how human decision makers with bounded rationality choose strategies in interactive decisions. Behavioral economics, and more generally experimental games, have appeared in the literature with accelerating frequency since 1990, and this cannot continue inde...

2011
Jos B. T. M. Roerdink

Historically, mathematical morphology has primarily focused on the processing and analysis of two-dimensional image data. In this paper, we survey a number of other areas where mathematical morphology finds fruitful application, such as computer graphics and solid modeling; path planning; filtering, segmentation and visualization of volume data; or visual exploration of high-dimensional data. W...

Journal: :SIAM J. Scientific Computing 1993
Achi Brandt Irad Yavneh

Techniques are developed for accelerating multigrid convergence in general, and for advection-diffusion and incompressible flow problems with small viscosity in particular. It is shown by analysis that the slowing down of convergence is due mainly to poor coarse-grid correction to certain error components, and means for dealing with this problem are suggested, analyzed, and tested by numerical ...

Journal: :Int. J. Found. Comput. Sci. 2007
Mathieu Giraud Philippe Veber Dominique Lavenier

Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints, requiring efficient ε-transitions-removal techniques. In this paper, we present bounds on the number of new transitions for the development of acyclic WFA, which is a special case of the ε-transitions-removal problem. ...

1990
Yann LeCun Ido Kanter Sara A. Solla

The learning time of a simple neural network model is obtained through an analytic computation of the eigenvalue spectrum for the Hessian matrix, which describes the second order properties of the cost function in the space of coupling coefficients. The form of the eigenvalue distribution suggests new techniques for accelerating the learning process, and provides a theoretical justification for...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2017
Eliodoro Chiavazzo Roberto Covino Ronald R Coifman C William Gear Anastasia S Georgiou Gerhard Hummer Ioannis G Kevrekidis

We describe and implement a computer-assisted approach for accelerating the exploration of uncharted effective free-energy surfaces (FESs). More generally, the aim is the extraction of coarse-grained, macroscopic information from stochastic or atomistic simulations, such as molecular dynamics (MD). The approach functionally links the MD simulator with nonlinear manifold learning techniques. The...

2006
Mathieu Giraud Philippe Veber Dominique Lavenier D. Lavenier

Weighted finite automata (WFA) are used with accelerating hardware to scan large genomic banks. Hardwiring such automata raise surface area and clock frequency constraints, requiring efficient ε-transitions-removal techniques. In this paper, we present new bounds on the number of new transitions for several ε-transitions-removal problems. We study the case of acyclic WFA. We introduce a new pro...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید