Sciweavers

17789 search results - page 3395 / 3558
» Exceptional Use Cases
Sort
View
132
Voted
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 10 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
15 years 10 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
VMCAI
2007
Springer
15 years 10 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
WABI
2007
Springer
102views Bioinformatics» more  WABI 2007»
15 years 10 months ago
Homology Search with Fragmented Nucleic Acid Sequence Patterns
The comprehensive annotation of non-coding RNAs in newly sequenced genomes is still a largely unsolved problem because many functional RNAs exhibit not only poorly conserved sequen...
Axel Mosig, Julian J.-L. Chen, Peter F. Stadler
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
15 years 10 months ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
« Prev « First page 3395 / 3558 Last » Next »