Sciweavers

507 search results - page 5 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
SIAMJO
2008
108views more  SIAMJO 2008»
13 years 7 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
BC
2006
80views more  BC 2006»
13 years 7 months ago
Sparse Spatial Sampling for the Computation of Motion in Multiple Stages
The avian retino-tecto-rotundal pathway plays a central role in motion analysis and features complex connectivity. Yet, the relation between the pathway's structural arrangeme...
Alireza S. Mahani, Reza Khanbabaie, Harald Luksch,...
MFCS
2005
Springer
14 years 1 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
JSC
2007
106views more  JSC 2007»
13 years 7 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia