Sciweavers

522 search results - page 7 / 105
» The 3-Steiner Root Problem
Sort
View
ISAAC
2004
Springer
94views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Error Compensation in Leaf Root Problems
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
JCB
2006
115views more  JCB 2006»
14 years 9 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
15 years 1 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
99
Voted
CORR
2010
Springer
111views Education» more  CORR 2010»
14 years 9 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
TSP
2008
180views more  TSP 2008»
14 years 9 months ago
A Square-Root Nyquist (M) Filter Design for Digital Communication Systems
Designing matched transmit and receive filters such that their combination satisfies the Nyquist condition is a classical problem in digital communication systems. In this paper, ...
Behrouz Farhang-Boroujeny