Sciweavers

99 search results - page 15 / 20
» Inspection by Implicit Polynomials
Sort
View
CANS
2009
Springer
164views Cryptology» more  CANS 2009»
15 years 4 months ago
Extensions of the Cube Attack Based on Low Degree Annihilators
At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an ini...
Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Lei We...
ACCV
2009
Springer
15 years 2 months ago
Multilevel Algebraic Invariants Extraction by Incremental Fitting Scheme
Algebraic invariants extracted from coefficients of implicit polynomials (IPs) have been attractive because of its convenience for solving the recognition problem in computer visio...
Bo Zheng, Jun Takamatsu, Katsushi Ikeuchi
ECCC
2008
98views more  ECCC 2008»
14 years 10 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
SIAMMAX
2011
157views more  SIAMMAX 2011»
14 years 19 days ago
Deflated Restarting for Matrix Functions
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...
ALT
2004
Springer
15 years 6 months ago
On Kernels, Margins, and Low-Dimensional Mappings
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
Maria-Florina Balcan, Avrim Blum, Santosh Vempala