This paper introduces a discriminative extension to whole-word point process modeling techniques. Meant to circumvent the strong independence assumptions of their generative prede...
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
[1, 2] have shown for the dynamic spectrum allocation problem that a competitive market model (which sets a price for transmission power on each channel) leads to a greater social...
Dynamic epistemic logic (DEL) as viewed by Baltag et col. and propositional dynamic logic (PDL) offer different semantics of events. On the one hand, DEL adds dynamics to epistem...