نتایج جستجو برای: von mise graphs
تعداد نتایج: 198093 فیلتر نتایج به سال:
RÉSUMÉ. Dans les systèmes temps réel manipulant des tâches périodiques, des travaux introduisant la notion de contraintes (m,k)-firm ont été effectués. Ces contraintes permettent de relaxer les contraintes temps réel des tâches en autorisant que certaines invocations d’une tâche soient perdues. D’un autre côté, dans les SGBD temps réel, certaines transactions périodiques permettent, de rafraîch...
RÉSUMÉ. Le développement des systèmes de gestion de contenu a profondément changé la nature du web : de plus en plus de documents sont créés automatiquement et leur mise en page reflète leur structure logique. Dans ce travail, nous montrons que l’information contenue dans la mise en page est suffisante pour inférer une structure sémantiquement riche, ce qui ouvre la voie à de nombreuses applica...
The MISE Project (Mediation Information System Engineering) aims at providing virtual enterprises with a Mediation Information System (MIS) in charge of supporting interoperability in a collaborative network. MISE proposes an overall MIS design method according to a model-driven approach, based on model transformations. This MIS is in charge of (i) information management, (ii) services sharing ...
a 22 year-old woman presented with gradual visual loss in her right eye since 1990. medical and family histories were unremarkable. her visual acuity was 20/80 and 20/20 in right and left eyes respectively. slit lamp examination was quite normal with no relative afferent papillary defect.fundi of both eyes revealed subretinal lesion with optic nerve head involvement and subretinal fluid in papi...
In this paper, we provide an asymptotic expression for mean integrated squared error (MISE) of nonlinear wavelet density estimator for a truncation model. It is assumed that the lifetime observations form a stationary α-mixing sequence. Unlike for kernel estimator, the MISE expression of the nonlinear wavelet estimator is not affected by the presence of discontinuities in the curves. Also, we e...
In this paper, we consider estimating the intensity of a recurrent event process observed under a standard censoring scheme. We first propose a collection of kernel estimators for which we provide MSE and MISE bounds. We then describe and study an adaptive procedure of bandwidth selection, in the spirit of Goldenshluger and Lepski (2011), and prove an oracle type bound for both the MSE and the ...
the first ($pi_1$) and the second $(pi_2$) multiplicative zagreb indices of a connected graph $g$, with vertex set $v(g)$ and edge set $e(g)$, are defined as $pi_1(g) = prod_{u in v(g)} {d_u}^2$ and $pi_2(g) = prod_{uv in e(g)} {d_u}d_{v}$, respectively, where ${d_u}$ denotes the degree of the vertex $u$. in this paper we present a simple approach to order these indices for connected graphs on ...
This bachelor thesis focuses on the integration of turn costs in route planning for electric vehicles. First the information provided by the PHEM [HRZL09] data is used to create consumption values for turn costs. An accordingly appropriate matching principle is described to link costs of brake or acceleration maneuvers extracted from this data to turns in graphs representing road networks. Next...
The von Mises model encodes a multivariate circular distribution as an undirected probabilistic graphical model. Presently, the only algorithm for performing inference in the model is Gibbs sampling, which becomes inefficient for large graphs. To address this issue, we introduce an Expectation Propagation based algorithm for performing inference in the von Mises graphical model. Our approach in...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید