485 search results - page 31 / 97 » Iterative Bounding LAO |
158
click to vote
AAAI
2011
14 years 4 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
124
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
119
click to vote
ISIPTA
2003
IEEE
15 years 9 months ago
2003
IEEE
A generalization of deFinetti’s Fundamental Theorem of Probability facilitates coherent assessment, by iterated natural extension, of imprecise probabilities or expectations, co...
149
Voted
EPEW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
124
click to vote
VLSISP
2008
15 years 4 months ago
2008
Abstract. In this paper we propose an architecture design methodology to optimize the throughput of MD4-based hash algorithms. The proposed methodology includes an iteration bound ...