Sciweavers

2397 search results - page 30 / 480
» Applications of integer relation algorithms
Sort
View
ECCC
1998
118views more  ECCC 1998»
13 years 10 months ago
Chinese Remaindering with Errors
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...
Oded Goldreich, Dana Ron, Madhu Sudan
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
14 years 5 months ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
14 years 5 months ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 11 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
ICNC
2009
Springer
14 years 5 months ago
Reducing Boarding Time: Synthesis of Improved Genetic Algorithms
—With the aim to minimize boarding time and devise procedures for boarding strategies, this paper develop the synthesis of Improved Genetic Algorithms and simulation. This paper ...
Kang Wang