Sciweavers

1695 search results - page 297 / 339
» Linear, Polynomial or Exponential
Sort
View
95
Voted
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
15 years 6 months ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
FCT
2005
Springer
15 years 6 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
ICML
2004
IEEE
15 years 6 months ago
Learning a kernel matrix for nonlinear dimensionality reduction
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
Kilian Q. Weinberger, Fei Sha, Lawrence K. Saul
AES
2004
Springer
151views Cryptology» more  AES 2004»
15 years 6 months ago
General Principles of Algebraic Attacks and New Design Criteria for Cipher Components
This paper is about the design of multivariate public key schemes, as well as block and stream ciphers, in relation to recent attacks that exploit various types of multivariate alg...
Nicolas Courtois
94
Voted
GD
2004
Springer
15 years 6 months ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...