Sciweavers

504 search results - page 68 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
CHES
2003
Springer
106views Cryptology» more  CHES 2003»
14 years 3 months ago
Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves
For most of the time since they were proposed, it was widely believed that hyperelliptic curve cryptosystems (HECC) carry a substantial performance penalty compared to elliptic cur...
Jan Pelzl, Thomas J. Wollinger, Jorge Guajardo, Ch...
INFOVIS
1997
IEEE
14 years 2 months ago
A spreadsheet approach to information visualization
In information visualization, as the volume and complexity of the data increases, researchers require more powerful visualization tools that enable them to more effectively explor...
Ed Huai-hsin Chi, Phillip Barry, John Riedl, Josep...
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
13 years 11 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
JUCS
2010
106views more  JUCS 2010»
13 years 8 months ago
A Heuristic Approach to Positive Root Isolation for Multiple Power Sums
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
Ming Xu, Chuandong Mu, Zhenbing Zeng, Zhi-bin Li
SIAMMAX
2010
103views more  SIAMMAX 2010»
13 years 4 months ago
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
Vance Faber, Jörg Liesen, Petr Tichý