Sciweavers

2165 search results - page 405 / 433
» cases 2005
Sort
View
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 2 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
14 years 2 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...
CISC
2005
Springer
109views Cryptology» more  CISC 2005»
14 years 2 months ago
Enforcing Email Addresses Privacy Using Tokens
We propose a system which allows users to monitor how their email addresses are used and how they spread over the Internet. This protects the privacy of the user and can reduce the...
Roman Schlegel, Serge Vaudenay
CIVR
2005
Springer
154views Image Analysis» more  CIVR 2005»
14 years 2 months ago
A Novel Texture Descriptor Using Over-Complete Wavelet Transform and Its Fractal Signature
In the paper, we proposed a novel feature descriptor using over-complete wavelet transform and wavelet domain based fractal signature for texture image analysis and retrieval. Trad...
Qing Wang, David Dagan Feng
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 2 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