Sciweavers

195 search results - page 23 / 39
» Identity-Based Zero Knowledge
Sort
View
IACR
2011
152views more  IACR 2011»
12 years 7 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
COLING
1996
13 years 9 months ago
Anaphora Resolution of Japanese Zero Pronouns with Deictic Reference
This paper proposes a method to resolve the reference of deictic Japanese zero pronouns which can be implemented in a practical machine translation system. This method focuses on ...
Hiromi Nakaiwa, Satoshi Shirai
EMNLP
2010
13 years 5 months ago
A Tree Kernel-Based Unified Framework for Chinese Zero Anaphora Resolution
This paper proposes a unified framework for zero anaphora resolution, which can be divided into three sub-tasks: zero anaphor detection, anaphoricity determination and antecedent ...
Fang Kong, Guodong Zhou
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
Approaching the Zero-Outage Capacity of MIMO-OFDM Without Instantaneous Water-Filling
Orthogonal-frequency-divisionmultiplexing(OFDM) transforms a frequency-selective multiple-input multiple-output (MIMO) fading channel into a MIMO-OFDM channel that has a well-defin...
Joon Hyun Sung, John R. Barry
EMNLP
2009
13 years 5 months ago
A Probabilistic Model for Associative Anaphora Resolution
This paper proposes a probabilistic model for associative anaphora resolution in Japanese. Associative anaphora is a type of bridging anaphora, in which the anaphor and its antece...
Ryohei Sasano, Sadao Kurohashi