Sciweavers

166 search results - page 8 / 34
» Resultants of partially composed polynomials
Sort
View
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 7 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
VISUAL
2000
Springer
13 years 11 months ago
Statistical Motion-Based Retrieval with Partial Query
We present an original approach for motion-based retrieval involving partial query. More precisely, we propose an uni ed statistical framework both to extract entities of interest ...
Ronan Fablet, Patrick Bouthemy
ANLP
1994
97views more  ANLP 1994»
13 years 8 months ago
Recycling Terms into a Partial Parser
Both full-text information retrieval and large scale parsing require text preprocessing to identify strong lexical associations in textual databases. In order to associate linguis...
Christian Jacquemin
TCC
2010
Springer
141views Cryptology» more  TCC 2010»
13 years 5 months ago
Composition of Zero-Knowledge Proofs with Efficient Provers
We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input)...
Eleanor Birrell, Salil P. Vadhan
MFCS
2010
Springer
13 years 5 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich