Results 261 to 270 of about 29,270 (312)
Two-stage acoustic detection and fine-grained classification of laying-hen vocalizations for heat-stress monitoring. [PDF]
Lin X +7 more
europepmc +1 more source
Long-term stability analysis of beam shape in a robotic radiosurgery system. [PDF]
Hinoto R +4 more
europepmc +1 more source
Interactive segmentation of membrane and membrane mimic densities in cryo-EM maps
Bharadwaj A, Veerbeek L, Jakobi AJ.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fundamenta Informaticae, 2009
A new way of constructing N-way arbiters is proposed. The main idea is to perform arbitrations between all pairs of requests, and then make decision on what grant to issue based on their outcomes. Crucially, all the mutual exclusion elements in such an arbiter work in parallel. This ‘flat’ arbitration is prone to new threats such as formation of cycles
Andrey Mokhov +2 more
openaire +2 more sources
A new way of constructing N-way arbiters is proposed. The main idea is to perform arbitrations between all pairs of requests, and then make decision on what grant to issue based on their outcomes. Crucially, all the mutual exclusion elements in such an arbiter work in parallel. This ‘flat’ arbitration is prone to new threats such as formation of cycles
Andrey Mokhov +2 more
openaire +2 more sources
Neural Computation, 1997
We present a new algorithm for finding low-complexity neural networks with high generalization capability. The algorithm searches for a “flat” minimum of the error function. A flat minimum is a large connected region in weight space where the error remains approximately constant.
Hochreiter, Sepp, Schmidhuber, Jürgen
openaire +3 more sources
We present a new algorithm for finding low-complexity neural networks with high generalization capability. The algorithm searches for a “flat” minimum of the error function. A flat minimum is a large connected region in weight space where the error remains approximately constant.
Hochreiter, Sepp, Schmidhuber, Jürgen
openaire +3 more sources
Flat and weakly flat projection algebras
Algebra Universalis, 2002The concept of a projection algebra was introduced by \textit{H.\ Ehrig} and his collaborators as an algebraic version of ultrametric spaces. This concept is useful in computer science as a convenient tool for algebraic specification of process algebras. By \(\mathcal{PRO}\) is denoted the category of projection algebras.
Ebrahimi, M. Mehdi, Mahmoudi, M.
openaire +1 more source
ACM SIGGRAPH 2012 Computer Animation Festival, 2012
Flat Frog is based on the misadventures of two rustic frogs that are always anxious to cross the road in search of females. Ever the ignorant optimists, the two rubes manage to get run over again and again out on the road but this never seems to dampen.
openaire +3 more sources
Flat Frog is based on the misadventures of two rustic frogs that are always anxious to cross the road in search of females. Ever the ignorant optimists, the two rubes manage to get run over again and again out on the road but this never seems to dampen.
openaire +3 more sources
Pullback-Flat Acts are Strongly Flat
Canadian Mathematical Bulletin, 1991AbstractLet 5 be a monoid. A right S-system A is called strongly flat if the functor A ⊗ — (from the category of left S-systems into the category of sets) preserves pullbacksand equalizers. (This concept arises in B. Stenström, Math. Nachr. 48(1971), 315-334 under the name weak flatness). The main result of the present paper is a proof that for A to be
openaire +1 more source
Of Mud Flats, Mixed Mud Flats and Sand Flats
German Research, 2004AbstractThe extended tidal mud flats found in various climate zones are a result of the tides. Using the southern North Sea as their research area, scientists study how ecological processes operate in the threatened “Wadden Sea ...
openaire +1 more source

