Sciweavers

2412 search results - page 35 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Online kernel PCA with entropic matrix updates
A number of updates for density matrices have been developed recently that are motivated by relative entropy minimization problems. The updates involve a softmin calculation based...
Dima Kuzmin, Manfred K. Warmuth
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 9 months ago
Interpolation in Valiant's theory
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
Pascal Koiran, Sylvain Perifel
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
SAC
2005
ACM
14 years 3 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 3 months ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose