Sciweavers

1923 search results - page 69 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ICDM
2010
IEEE
160views Data Mining» more  ICDM 2010»
14 years 7 months ago
A Privacy Preserving Framework for Gaussian Mixture Models
Abstract--This paper presents a framework for privacypreserving Gaussian Mixture Model computations. Specifically, we consider a scenario where a central service wants to learn the...
Madhusudana Shashanka
CPC
1998
91views more  CPC 1998»
14 years 9 months ago
Complexity and Probability of Some Boolean Formulas
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
Petr Savický
ISORC
2005
IEEE
15 years 3 months ago
Adaptable Situation-Aware Secure Service-Based (AS3) Systems
Service-based systems have many applications, including collaborative research and development, e-business, health care, environmental control, military applications, and homeland...
Stephen S. Yau, Hasan Davulcu, Supratik Mukhopadhy...
SACMAT
2010
ACM
15 years 2 months ago
An access control model for mobile physical objects
Access to distributed databases containing tuples collected about mobile physical objects requires information about the objects’ trajectories. Existing access control models ca...
Florian Kerschbaum
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 9 months ago
Stochastic Games for Security in Networks with Interdependent Nodes
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
Kien C. Nguyen, Tansu Alpcan, Tamer Basar