Sciweavers

16596 search results - page 3132 / 3320
» Generalized Assignment Problems
Sort
View
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
15 years 12 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
CIKM
2005
Springer
15 years 12 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
15 years 12 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»
15 years 12 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
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
15 years 12 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
« Prev « First page 3132 / 3320 Last » Next »