644 search results - page 3 / 129 » On the analysis of average time complexity of estimation of ... |
COCO
1995
Springer
13 years 9 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
WCNC
2008
IEEE
13 years 11 months ago
2008
IEEE
—Among all blind channel estimation problems, subspace-based algorithms are attractive due to its fastconverging nature. It primarily exploits the orthogonality structure of the ...
AMC
2007
13 years 5 months ago
2007
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
We deal with consensus-based online estimation and tracking of (non-) stationary signals using ad hoc wireless sensor networks (WSNs). A distributed (D-) least-mean square (LMS) l...