نتایج جستجو برای: von mise graphs

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

2015
Narges Sharif Razavian Hetunandan Kamisetty Christopher J. Langmead Narges Razavian Christopher James Langmead

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...

2005
C. Marie-Françoise Canut Max Chevalier André Péninou Florence Sèdes

Résumé. L'objectif de ce papier est de présenter une contribution à la modélisation des individus et de leurs relations pour permettre l’aide à l'intégration des acteurs dans une organisation. Nous étudions en particulier le cas du remplacement d'un acteur (« turn-over »). Dans ce cadre, nous proposons un modèle regroupant un ensemble de données relatives à un individu, aux relations que celui-...

Journal: :CoRR 2017
Yashar Deldjoo Massimo Quadrana Mehdi Elahi Paolo Cremonesi

Item features play an important role in movie recommender systems, where recommendations can be generated by using explicit or implicit preferences of users on traditional features (attributes) such as tag, genre, and cast. Typically, movie features are human-generated, either editorially (e.g., genre and cast) or by leveraging the wisdom of the crowd (e.g., tag), and as such, they are prone to...

Journal: :journal of algebra and related topics 2014
m. alaeiyan l. pourmokhtar m. k. hosseinpoor

a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

Journal: :bulletin of the iranian mathematical society 2015
j. zhao j. wu

the aim of this note is to study the submajorization inequalities for $tau$-measurable operators in a semi-finite von neumann algebra on a hilbert space with a normal faithful semi-finite trace $tau$. the submajorization inequalities generalize some results due to zhang, furuichi and lin, etc..

Journal: :CoRR 2012
Houari Mahfoud Abdessamad Imine

Over the past years several works have proposed access control models for XML data where only read-access rights over non-recursive DTDs are considered. A few amount of works have studied the access rights for updates. In this paper, we present a general model for specifying access control on XML data in the presence of update operations of W3C XQuery Update Facility. Our approach for enforcing...

Abdolmajid Mortazavi, Asghar Eghbali, Faeze Ahmadi, Hossein Bijan, Rahmatollah Samiee,

Les a uteurs presentent l'etude clinique, diagnos­tigue et therapeutique d'un cas diffus de "pied d'ath­tete" (athlete's foot) cause par Trichophyton menta gropbyte. chez un malade frequentant des piscines publiques. Ils signalent ensuite des mesures prophy­lactiques dont la mise en oeuvre se voit necessaire pour la prevention des affectiosn fungiques des es­paces interdigitaux. 

Journal: :CoRR 2011
Christian Retoré

Présentation mise à disposition dans l'attente de la parution du volume aux éditions Cassini

2015
Sungyoung Lee Joon Yoon Seungyeoun Lee Taesung Park

Gene-gene interaction (GGI) plays an important role in the causation of complex diseases, and its importance has now been well recognized through the findings of many successful genome-wide association studies (GWAS). Although many statistical methods have been introduced to address GGI analysis in GWAS, these methods have mainly focused on two-way interactions, rather than on high-order intera...

Journal: :Theor. Comput. Sci. 2005
Frédéric Cazals Chinmay Karande

Given two graphs, a fundamental task faced by matching algorithms consists of computing either the (Connected) Maximal Common Induced Subgraphs ((C)MCIS) or the (Connected) Maximal Common Edge Subgraphs ((C)MCES). In particular, computing the CMCIS or CMCES reduces to reporting so-called connected cliques in product graphs, a problem for which an algorithm has been presented in a recent paper I...

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

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