Sciweavers

184 search results - page 34 / 37
» Querying Proofs
Sort
View
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
IFIP
2004
Springer
14 years 1 months ago
Behavioural Equivalences for Dynamic Web Data
Peer-to-peer systems, exchanging dynamic documents through Web services, are a simple and effective platform for data integration on the internet. Dynamic documents can contain b...
Sergio Maffeis, Philippa Gardner
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 9 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
NDQA
2003
119views Education» more  NDQA 2003»
13 years 9 months ago
Inference Web: Portable and Sharable Explanations for Question Answering
The World Wide Web lacks support for explaining information provenance. When web applications return results, many users do not know what information sources were used, when they ...
Deborah L. McGuinness, Paulo Pinheiro da Silva
BIODATAMINING
2008
117views more  BIODATAMINING 2008»
13 years 7 months ago
Search extension transforms Wiki into a relational system: A case for flavonoid metabolite database
Background: In computer science, database systems are based on the relational model founded by Edgar Codd in 1970. On the other hand, in the area of biology the word 'databas...
Masanori Arita, Kazuhiro Suwa