Sciweavers

80 search results - page 6 / 16
» On the Complexity of Real Root Isolation
Sort
View
JSC
2010
99views more  JSC 2010»
14 years 8 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
FASE
2009
Springer
15 years 2 months ago
Algorithms for Automatically Computing the Causal Paths of Failures
We have proposed an automated debugging technique that explains a failure by computing its causal path leading from the root cause to the failure. Given a failing execution, the te...
William N. Sumner, Xiangyu Zhang
CORR
1998
Springer
105views Education» more  CORR 1998»
14 years 9 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
MOC
1998
92views more  MOC 1998»
14 years 9 months ago
Perturbing polynomials with all their roots on the unit circle
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...
DATE
2007
IEEE
100views Hardware» more  DATE 2007»
14 years 10 months ago
A new pipelined implementation for minimum norm sorting used in square root algorithm for MIMO-VBLAST systems
Multiple Input - Multiple Output (MIMO) wireless technology involves highly complex vectors and matrix computations which are directly related to increased power and area consumpt...
Zahid Khan, Tughrul Arslan, John S. Thompson, Ahme...