Sciweavers

1923 search results - page 142 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
IPPS
2003
IEEE
15 years 7 months ago
Quantifying Locality Effect in Data Access Delay: Memory logP
The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared mem...
Kirk W. Cameron, Xian-He Sun
CSFW
2006
IEEE
15 years 8 months ago
Decentralized Robustness
Robustness links confidentiality and integrity properties of a computing system and has been identified as a useful property for characterizing and enforcing security. Previous ...
Stephen Chong, Andrew C. Myers
124
Voted
ICPR
2004
IEEE
16 years 3 months ago
Bayesian Face Recognition Based on Gaussian Mixture Models
Bayesian analysis is a popular subspace based face recognition method. It casts the face recognition task into a binary classification problem with each of the two classes, intrap...
Xiaogang Wang, Xiaoou Tang
160
Voted
PODC
2010
ACM
15 years 6 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
104
Voted
PODC
2009
ACM
16 years 2 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher