2168 search results - page 40 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
IWINAC
2007
Springer
14 years 1 months ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
SMILE
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, we explore the more practical aspects of building and rendering concentric mosaics. First, we use images captured with only approximately circular camera trajectorie...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The acceleration of acoustic likelihood calculation has been an important research issue for developing practical speech recognition systems. And there are various specification ...
DATE
2002
IEEE
14 years 21 days ago
2002
IEEE
Although algorithm level re-computing techniques can trade-off the detection capability of Concurrent Error Detection (CED) vs. time overhead, it results in 100% time overhead whe...
ATVA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...