Sciweavers

43264 search results - page 8184 / 8653
» Comparing models of computation
Sort
View
CCS
2004
ACM
16 years 8 days ago
Direct anonymous attestation
This paper describes the direct anonymous attestation scheme (DAA). This scheme was adopted by the Trusted Computing Group as the method for remote authentication of a hardware mo...
Ernest F. Brickell, Jan Camenisch, Liqun Chen
CIA
2004
Springer
16 years 8 days ago
Towards Monitoring of Group Interactions and Social Roles via Overhearing
We are investigating how to provide intelligent, pervasive support of group of people within so-called “smart environments”. Our current main assumption, based on literature in...
Silvia Rossi, Paolo Busetta
CIKM
2004
Springer
16 years 8 days ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
CLEF
2004
Springer
16 years 8 days ago
Application of Variable Length N-Gram Vectors to Monolingual and Bilingual Information Retrieval
Our group in the Department of Informatics at the University of Oviedo has participated, for the first time, in two tasks at CLEF: monolingual (Russian) and bilingual (Spanish-to-E...
Daniel Gayo-Avello, Darío Álvarez Gu...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
16 years 8 days ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
« Prev « First page 8184 / 8653 Last » Next »