Sciweavers

149 search results - page 6 / 30
» Solving Very Sparse Rational Systems of Equations
Sort
View
COLT
2004
Springer
14 years 27 days ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
SIAMNUM
2011
139views more  SIAMNUM 2011»
13 years 2 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
DAGSTUHL
2007
13 years 9 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
Nicolas Courtois
JSCIC
2008
43views more  JSCIC 2008»
13 years 7 months ago
A Dual-Petrov-Galerkin Method for the Kawahara-Type Equations
Abstract An efficient and accurate numerical scheme is proposed, analyzed and implemented for the Kawahara and modified Kawahara equations which model many physical phenomena such ...
Juan-Ming Yuan, Jie Shen, Jiahong Wu
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 1 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...