Sciweavers

2475 search results - page 304 / 495
» Question Answering in TREC
Sort
View
CONCUR
2005
Springer
16 years 3 days ago
Games Where You Can Play Optimally Without Any Memory
Abstract. Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, t...
Hugo Gimbert, Wieslaw Zielonka
VLDB
2005
ACM
139views Database» more  VLDB 2005»
16 years 1 days ago
Tree-Pattern Queries on a Lightweight XML Processor
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
16 years 1 days ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...
ASIACRYPT
2004
Springer
15 years 12 months ago
A Public-Key Black-Box Traitor Tracing Scheme with Sublinear Ciphertext Size Against Self-Defensive Pirates
We propose a public-key traitor tracing scheme in which (1) the size of a ciphertext is sublinear in the number of receivers and (2) black-box tracing is efficiently achieved again...
Tatsuyuki Matsushita, Hideki Imai
WABI
2004
Springer
15 years 12 months ago
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Jens Gramm