1331 search results - page 119 / 267 » Complexity bounds for zero-test algorithms |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In this paper, the problem of estimating the damping factor and frequency parameters from multiple cisoids in noise is addressed. We rst propose a data matrix which generalizes th...
RTAS
2006
IEEE
14 years 4 months ago
2006
IEEE
The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume...
ESA
2004
Springer
14 years 3 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
COCO
2007
Springer
14 years 4 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
DAC
1994
ACM
14 years 2 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...