Sciweavers

1469 search results - page 85 / 294
» Approximate polynomial decomposition
Sort
View
TSP
2010
14 years 4 months ago
A low complexity blind estimator of narrowband polynomial phase signals
Consider the problem of estimating the parameters of multiple polynomial phase signals observed by a sensor array. In practice, it is difficult to maintain a precisely calibrated a...
Alon Amar, Amir Leshem, Alle-Jan van der Veen
INFOCOM
2007
IEEE
15 years 4 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
CORR
2006
Springer
159views Education» more  CORR 2006»
14 years 10 months ago
Structural Alignments of pseudo-knotted RNA-molecules in polynomial time
An RNA molecule is structured on several layers. The primary and most obvious structure is its sequence of bases, i.e. a word over the alphabet {A, C, G, U}. The higher structure i...
Michael Brinkmeier
DAGSTUHL
2004
14 years 11 months ago
Information-Based Nonlinear Approximation: An Average Case Setting
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
Leszek Plaskota
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...