Sciweavers

2957 search results - page 284 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
SIGPRO
2010
122views more  SIGPRO 2010»
15 years 5 months ago
Parameter estimation for exponential sums by approximate Prony method
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
Daniel Potts, Manfred Tasche
DAC
2011
ACM
14 years 6 months ago
Supervised design space exploration by compositional approximation of Pareto sets
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
Hung-Yi Liu, Ilias Diakonikolas, Michele Petracca,...
175
Voted
JELIA
1998
Springer
15 years 11 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
FUIN
2006
160views more  FUIN 2006»
15 years 6 months ago
Behavioral Pattern Identification Through Rough Set Modeling
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
Jan G. Bazan
GLOBECOM
2006
IEEE
16 years 22 days ago
Efficient Approximations for Call Admission Control Performance Evaluations in Multi-Service Networks
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
Emre A. Yavuz, Victor C. M. Leung