Sciweavers

16430 search results - page 866 / 3286
» On Computable Tree Functions
Sort
View
ACMSE
2008
ACM
15 years 9 months ago
Mining frequent sequential patterns with first-occurrence forests
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
Erich Allen Peterson, Peiyi Tang
DAGSTUHL
2007
15 years 9 months ago
Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...
IJCAI
2007
15 years 9 months ago
Winner Determination in Sequential Majority Voting
Voting rules map collections of preference orderings over a set of candidates (one for each voter) to candidates. Now, in many contexts, we have to consider the case where either t...
Jérôme Lang, Maria Silvia Pini, Franc...
IJON
2006
68views more  IJON 2006»
15 years 7 months ago
Dendritic cable with active spines: A modelling study in the spike-diffuse-spike framework
The spike-diffuse-spike (SDS) model describes a passive dendritic tree with active dendritic spines. Spine-head dynamics is modelled with a simple integrate-and-fire process, whil...
Yulia Timofeeva, Gabriel J. Lord, Stephen Coombes
AUTOMATICA
2010
106views more  AUTOMATICA 2010»
15 years 6 months ago
Fault detection for discrete event systems using Petri nets with unobservable transitions
In this paper we present an efficient approach for the fault detection of discrete event systems using Petri nets. We assume that some of the transitions of the net are unobservabl...
Maria Paola Cabasino, Alessandro Giua, Carla Seatz...