Sciweavers

14518 search results - page 2733 / 2904
» Two Problems for Sophistication
Sort
View
CCS
2005
ACM
14 years 4 months ago
Automated trust negotiation using cryptographic credentials
In automated trust negotiation (ATN), two parties exchange digitally signed credentials that contain attribute information to establish trust and make access control decisions. Be...
Jiangtao Li, Ninghui Li, William H. Winsborough
CEEMAS
2005
Springer
14 years 4 months ago
MAS Meta-models on Test: UML vs. OPM in the SODA Case Study
In the AOSE (Agent-Oriented Software Engineering) area, several research efforts are underway to develop appropriate meta-models for agent-oriented methodologies. Meta-models are ...
Ambra Molesini, Enrico Denti, Andrea Omicini
CIKM
2005
Springer
14 years 4 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
CIKM
2005
Springer
14 years 4 months ago
A function-based access control model for XML databases
XML documents are frequently used in applications such as business transactions and medical records involving sensitive information. Typically, parts of documents should be visibl...
Naizhen Qi, Michiharu Kudo, Jussi Myllymaki, Hamid...
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 4 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
« Prev « First page 2733 / 2904 Last » Next »