Sciweavers

6047 search results - page 398 / 1210
» Modeling with Extend
Sort
View
ORL
2007
96views more  ORL 2007»
15 years 5 months ago
A note on scenario reduction for two-stage stochastic programs
We extend earlier work on scenario reduction by relying directly on Fortet–Mourier metrics instead of using upper bounds given in terms of mass transportation problems. The impo...
Holger Heitsch, Werner Römisch
IEEEHPCS
2010
15 years 4 months ago
Timed protocols insecurity problem is NP-complete
—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rus...
Massimo Benerecetti, Nicola Cuomo, Adriano Peron
ACSD
2010
IEEE
261views Hardware» more  ACSD 2010»
15 years 4 months ago
Partial Order Reduction for Branching Security Protocols
We extend the partial order reduction algorithm of Clarke et al. [CJM00] to handle branching security protocols, such as optimistic fair exchange protocols. Applications of the pro...
Wan Fokkink, Mohammad Torabi Dashti, Anton Wijs
162
Voted
JLP
2011
160views more  JLP 2011»
15 years 1 months ago
Axiomatizability of representable domain algebras
The family of domain algebras provide an elegant formal system for automated reasoning about programme verification. Their primary models are algebras of relations, viz. represen...
Robin Hirsch, Szabolcs Mikulás
150
Voted
CIKM
2008
Springer
15 years 8 months ago
An extension of PLSA for document clustering
In this paper we propose an extension of the PLSA model in which an extra latent variable allows the model to cocluster documents and terms simultaneously. We show on three datase...
Young-Min Kim, Jean-François Pessiot, Massi...