Sciweavers

2440 search results - page 283 / 488
» Data-Intensive Question Answering
Sort
View
LATINCRYPT
2010
15 years 3 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
146
Voted
MST
2010
83views more  MST 2010»
15 years 3 months ago
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
ORDER
2010
110views more  ORDER 2010»
15 years 3 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
196
Voted
PKAW
2010
15 years 3 months ago
MMG: A Learning Game Platform for Understanding and Predicting Human Recall Memory
How humans infer probable information from the limited observed data? How they are able to build on little knowledge about the context in hand? Is the human memory repeatedly const...
Umer Fareed, Byoung-Tak Zhang
VTC
2010
IEEE
166views Communications» more  VTC 2010»
15 years 3 months ago
On Capacity-Maximizing Angular Densities of Multipath in MIMO Channels
– This paper provides a partial answer to the question: "what is the best angular density of multipath in MIMO channels?" using the size-asymptotic theory of Toeplitz m...
George Levin, Sergey Loyka