Sciweavers

2430 search results - page 53 / 486
» Computing Tutte Polynomials
Sort
View
RTSS
2009
IEEE
14 years 4 months ago
Verifying Tolerant Systems Using Polynomial Approximations
Pavithra Prabhakar, Vladimeros Vladimerou, Mahesh ...
MFCS
2004
Springer
14 years 3 months ago
Polynomial Time Approximation Schemes and Parameterized Complexity
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
NC
2011
236views Neural Networks» more  NC 2011»
13 years 29 days ago
Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be ap...
Hans-Jörg Kreowski, Sabine Kuske
CASC
2009
Springer
103views Mathematics» more  CASC 2009»
14 years 4 months ago
Lazy and Forgetful Polynomial Arithmetic and Applications
We present lazy and forgetful algorithms for adding, multiplying and dividing multivariate polynomials. The lazy property allows us to compute the i-th term of a polynomial withou...
Michael B. Monagan, Paul Vrbik
ICCV
2011
IEEE
12 years 10 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis