Sciweavers

CORR
2011
Springer
171views Education» more  CORR 2011»
13 years 5 months ago
A Class of Probabilistic Automata with a Decidable Value 1 Problem
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Ou...
ICTAI
2006
IEEE
14 years 5 months ago
Sequence Mining Without Sequences: A New Way for Privacy Preserving
During the last decade, sequential pattern mining has been the core of numerous researches. It is now possible to efficiently discover users’ behavior in various domains such a...
Stéphanie Jacquemont, François Jacqu...