Sciweavers

2214 search results - page 415 / 443
» complexity 2004
Sort
View
ASIACRYPT
2004
Springer
14 years 3 months ago
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
In the bare public-key model, introduced by Canetti et al. [STOC 2000], it is only assumed that each verifier deposits during a setup phase a public key in a file accessible by a...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
CIKM
2004
Springer
14 years 3 months ago
RStar: an RDF storage and query system for enterprise resource management
Modern corporations operate in an extremely complex environment and strongly depend on all kinds of information resources across the enterprise. Unfortunately, with the growth of ...
Li Ma, Zhong Su, Yue Pan, Li Zhang, Tao Liu
CLEF
2004
Springer
14 years 3 months ago
Content-Based Queries on the CasImage Database Within the IRMA Framework
Abstract. Recent research has suggested that there is no general similarity measure, which can be applied on arbitrary databases without any parameterization. Hence, the optimal co...
Christian Thies, Mark Oliver Güld, Benedikt F...
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
14 years 3 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
ECAI
2004
Springer
14 years 3 months ago
A Context-Based Model of Attention
d abstract)1 Niek Bergboer Eric Postma Jaap van den Herik Institute for Knowledge and Agent Technology, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht It is well known t...
Niek Bergboer, Eric O. Postma, H. Jaap van den Her...