Sciweavers

2576 search results - page 23 / 516
» The Complexity of Zero Knowledge
Sort
View
CORR
2007
Springer
96views Education» more  CORR 2007»
14 years 11 months ago
New Complexity Bounds for Certain Real Fewnomial Zero Sets
d Abstract) Frederic Bihan∗ Joel Gomez† Andrew Niles‡ J. Maurice Rojas§ January 24, 2007 Rojas dedicates this paper to his friend, Professor Tien-Yien Li. Consider real biv...
Joel Gomez, Andrew Niles, J. Maurice Rojas
SIAMNUM
2010
87views more  SIAMNUM 2010»
14 years 6 months ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer
GLOBECOM
2008
IEEE
15 years 6 months ago
Transmitter-Based Minimization of Error Rates in the Downlink of Wireless Systems
—Using CDMA technology, one has to contend with interference in frequency-selective channels caused by multipath propagation and fading. Transmitter-based methods such as Zero Fo...
Fred Richter, Andreas Fischer, René Habendo...
COLING
1996
15 years 1 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
IPL
2008
78views more  IPL 2008»
14 years 11 months ago
Resource-bounded measure on probabilistic classes
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...
Philippe Moser