Sciweavers

5 search results - page 1 / 1
» A Decomposition Theorem for Probabilistic Transition Systems
Sort
View
FOSSACS
2007
Springer
14 years 5 months ago
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
Franck van Breugel, Babita Sharma, James Worrell
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
14 years 4 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
CSFW
2007
IEEE
14 years 5 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
ICTIR
2009
Springer
14 years 5 months ago
PageRank: Splitting Homogeneous Singular Linear Systems of Index One
Abstract. The PageRank algorithm is used today within web information retrieval to provide a content-neutral ranking metric over web pages. It employs power method iterations to so...
Douglas V. de Jager, Jeremy T. Bradley