Sciweavers

849 search results - page 43 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
14 years 2 months ago
Optimal sensor activation in controlled discrete event systems
— The problem of sensor activation in a controlled discrete event system is considered. Sensors are assumed to be costly and can be turned on/off during the operation of the syst...
Weilin Wang, Stéphane Lafortune, Feng Lin
TCS
2008
13 years 7 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
ICASSP
2011
IEEE
12 years 11 months ago
A reweighted least squares algorithm for detection of QAM signaling in MIMO channels
This paper proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in multiple-input multiple-output (MIMO) channels. Although the QAM det...
Katsumi Konishi, Toshihiro Furukawa
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
14 years 12 hour 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
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
14 years 8 months ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj