Sciweavers

4117 search results - page 549 / 824
» On the Satisfiability of Complex Constraints
Sort
View
SAC
2004
ACM
16 years 6 days ago
A cost-oriented approach for infrastructural design
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
Danilo Ardagna, Chiara Francalanci, Marco Trubian
LATIN
2004
Springer
16 years 4 days ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
ELPUB
2007
ACM
15 years 10 months ago
Designing Metadata Surrogates for Search Result Interfaces of Learning Object Repositories: Linear versus Clustered Metadata Des
This study reports the findings of a usability test conducted to examine users' interaction with two different learning object metadata-driven search result interfaces. The f...
Panos Balatsoukas, Anne Morris, Ann O'Brien
CCS
2006
ACM
15 years 10 months ago
Resiliency policies in access control
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
Ninghui Li, Mahesh V. Tripunitara, Qihua Wang