نتایج جستجو برای: error generation

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

2005
Georgos Siganos Michalis Faloutsos

Attacks at the control and routing plane may be the next generation of threats for the Internet. Manipulation of the routing layer could originate from profiteering, malice, or simply human error. The community has recognized this danger and several promising approaches have been proposed. Most of these approaches attempt to capture and block routing anomalies. In practice, the difficulty of de...

1992
Helmut Emmelmann

1 I n t r o d u c t i o n The tree pat tern matching approach for code selection has proven very successful. I t allows to specify code selectors using declarative specifications and to derive efficient code selectors automatically. The program which translates the specification into the final code selector program is called code selector generator. Sometimes it is integrated with generators fo...

2001
Qigong Zheng Tapas Kanungo

Document images undergo various degradation processes. Numerous models of these degradation processes have been proposed in the literature. In this paper we propose a modelbased restoration algorithm. The restoration algorithm first estimates the parameters of a degradation model and then uses the estimated parameters to construct a lookup table for restoring the degraded image. The estimated d...

2013
Nicholas FitzGerald Yoav Artzi Luke S. Zettlemoyer

We present a new approach to referring expression generation, casting it as a density estimation problem where the goal is to learn distributions over logical expressions identifying sets of objects in the world. Despite an extremely large space of possible expressions, we demonstrate effective learning of a globally normalized log-linear distribution. This learning is enabled by a new, multi-s...

1993
Chuanyi Ji

For two layer networks with n sigmoidal hidden units, the generalization error is shown to be bounded by O(E~) O( (EK)d l N) K + N og , where d and N are the input dimension and the number of training samples, respectively. E represents the expectation on random number K of hidden units (1 :::; I\ :::; n). The probability Pr(I{ = k) (1 :::; k :::; n) is (kt.erl11ined by a prior distribution of ...

2005
Fang Qi Jin Zheng Weijia Jia Guojun Wang

In next generation network (NGN), end-to-end QoS is one of the critical issues for real-time multimedia communications and applications. Such applications are sensitive to the availability of bandwidth for a given path. Measuring bandwidth has attracted considerable research efforts in the networking community. This paper intends to the contribution to the available bandwidth measurement for NG...

2012

A classic model of infectious disease transmission was developed during the 1930s by Lowell J. Reed and Wade Hamptom Frost of Johns Hopkins. Because the model is simple to explain and provides valuable insights, we will discuss it at this time. In the classical Reed-Frost model, we assume a fixed population of size N . At each time, there are a certain number of cases of disease, C, and a certa...

Journal: :Proceedings : a conference of the American Medical Informatics Association. AMIA Fall Symposium 1997
Jeremy Rogers Alan L. Rector

A rigorous formal description of the intended behaviour of a compositional terminology, a 'third generation' system, enables powerful semantic processing techniques to assist in the building of a large terminology. Use of an intermediate representation derived from such a formalism, but simplified to resemble a 'second generation' system, enables authors to work in an simpler and more familiar ...

Journal: :Int. J. Reconfig. Comp. 2012
Christian de Schryver Daniel Schmidt Norbert Wehn Elke Korn Henning Marxen Anton Kostiuk Ralf Korn

Nonuniform random numbers are key for many technical applications, and designing efficient hardware implementations of nonuniform random number generators is a very active research field. However, most state-of-the-art architectures are either tailored to specific distributions or use up a lot of hardware resources. At ReConFig 2010, we have presented a new design that saves up to 48% of area c...

Journal: :IEICE Transactions 2005
Debatosh Debnath Tsutomu Sasao

Fixed polarity Reed-Muller expressions (FPRMs) exhibit several useful properties that make them suitable for many practical applications. This paper presents an exact minimization algorithm for FPRMs for incompletely specified functions. For an n-variable function with α unspecified minterms there are 2n+α distinct FPRMs, and a minimum FPRM is one with the fewest product terms. To find a minimu...

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

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