نتایج جستجو برای: transient minimization

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

Journal: :Theor. Comput. Sci. 2006
Cezar Câmpeanu Andrei Paun Jason R. Smith

We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the minimal DFCA for a language L has less states than the minimal DFA for the same language L, this technique seems to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the...

Journal: :Journal of Systems Architecture 2001
Marek A. Perkowski Lech Józwiak William Zhao

| A generalization of the classical state minimization problem for Finite State Machine (FSM) is proposed and discussed. In contrast to classical state minimization algorithms that minimize in one dimension (states), our algorithmminimizes the FSM in two dimensions: the numbers of both input symbols and internal state symbols are minimized in an iterative sequence of input minimization and stat...

Journal: :CoRR 2015
Arnaud De Myttenaere Boris Golden Bénédicte Le Grand Fabrice Rossi

We study in this paper the consequences of using the Mean Absolute Percentage Error (MAPE) as a measure of quality for regression models. We show that finding the best model under the MAPE is equivalent to doing weighted Mean Absolute Error (MAE) regression. We show that universal consistency of Empirical Risk Minimization remains possible using the MAPE instead of the MAE.

2013
Jean Paul Frédéric Serra Bangalore Ravi Kiran

A new approach is proposed for finding optimal cuts in hierarchies of partitions by energy minimization. It rests on the notion of h-increasingness, allows to find best(optimal) cuts in one pass, and to obtain nice ”climbing” scale space operators. The ways to construct h-increasing energies, and to combine them are studied, and illustrated by two examples on color and on textures.

2002
Mayumi Yuasa Osamu Yamaguchi Kazuhiro Fukui

We propose a new method to precisely detect pupil contours in faces. The method is based on minimizing the energy of pattern and edge. The basic idea of this method is that the energy, which consists of the pattern and the edge energy, has to be minimized. An efficient search method is also introduced to overcome the underlying problem of efficiency of energy minimization methods. "Guide patter...

Journal: :iranian journal of neurology 0
ali noureddine department of neurology, school of medicine, mashhad university of medical sciences, mashhad, iran. kavian ghandehari department of neurology, neuro cognitive research center, school of medicine, mashhad university of medical sciences, mashhad, iran. mohammad taghi shakeri department of social medicine, school of medicine, mashhad university of medical sciences, mashhad, iran.

background: previous literatures have shown a transient ischemic attack  (tia) mimic rate  of 9-31%. we aimed  to ascertain the proportion of stroke mimics amongst suspected tia patients. methods: a prospective observational study was performed in   ghaem   hospital,   mashhad,   iran   during   2012-2013. consecutive tia patients  were identified in a stroke center. the  initial diagnosis  of ...

Journal: :iranian journal of public health 0
mahtab ordooei 1. dept. of pediatrics, shahid sadoughi university of medical sciences , yazd , iran. azar rabiei 1. dept. of pediatrics, shahid sadoughi university of medical sciences , yazd , iran. reza soleimanizad 2. dept. of ophtalmology, shahid sadoughi university of medical sciences , yazd , iran. fatemeh mirjalili 3. shahid sadoughi university of medical sciences , yazd , iran.

congenital hypothyroidism is a condition of thyroid hormone deficiency. approximately 1 in 4000 newborn infants has a deficiency of thyroid function. the aim of this study is determination of the prevalence of permanent and transient congenital hypothyroidism (ch) in yazd, iran.from may 2006 to june 2008, 35377 newborns were screened by measuring serum tsh obtained by heel prick. the neonates w...

2012
Guillem Palou Philippe Salembier

This paper proposes a system to depth order regions of a frame belonging to a monocular image sequence. For a given frame, regions are ordered according to their relative depth using the previous and following frames. The algorithm estimates occluded and disoccluded pixels belonging to the central frame. Afterwards, a Binary Partition Tree (BPT) is constructed to obtain a hierarchical, region b...

2016
Martin Pergel Pawel Rzazewski

An EPG-representation of a graph G is a collection of paths in a plane square grid, each corresponding to a single vertex of G, so that two vertices are adjacent if and only if their corresponding paths share infinitely many points. In this paper we focus on graphs admitting EPG-representations by paths with at most 2 bends. We show hardness of the recognition problem for this class of graphs, ...

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

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