Sciweavers

100 search results - page 10 / 20
» Foundations of Attack-Defense Trees
Sort
View
IJPP
2007
91views more  IJPP 2007»
13 years 7 months ago
A Compositional Framework for Developing Parallel Programs on Two-Dimensional Arrays
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Masato...
MFCS
2010
Springer
13 years 5 months ago
Resource Combinatory Algebras
Abstract. We initiate a purely algebraic study of Ehrhard and Regnier’s resource λ-calculus, by introducing three equational classes of algebras: resource combinatory algebras, ...
Alberto Carraro, Thomas Ehrhard, Antonino Salibra
PLDI
2011
ACM
12 years 10 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
ICDCS
2003
IEEE
14 years 19 days ago
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
Huaiyu Liu, Simon S. Lam
SODA
2003
ACM
142views Algorithms» more  SODA 2003»
13 years 8 months ago
The similarity metric
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...