12052 search results - page 458 / 2411 » computing 2010 |
141
Voted
ECCC
2010
15 years 7 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
159
Voted
DSP
2006
15 years 6 months ago
2006
In this study, we extended the one-dimensional (1-D) unitary matrix pencil method (UMP) [N. Yilmazer, J. Koh, T.K. Sarkar, Utilization of a unitary transform for efficient computa...
182
click to vote
EAAI
2006
15 years 6 months ago
2006
This article is about a new approach in robotic learning systems. It provides a method to use a real-world device that operates in real-time, controlled through a simulated recurr...
184
click to vote
ECCC
2007
15 years 6 months ago
2007
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...
147
click to vote
ENTCS
2002
15 years 6 months ago
2002
If S = 0 is a system of n equations and unknowns over C and S() = 0 to what extent can we compute with the point ? In particular, can we decide whether or not a polynomial express...