459 search results - page 22 / 92 » Computational Complexity of Probabilistic Disambiguation |
TCOM
2010
14 years 10 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
107
click to vote
ICICS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The NRL Pump protocol defines a multilevel secure component whose goal is to minimize leaks of information from high level systems to lower level systems, without degrad...
126
Voted
CCGRID
2008
IEEE
15 years 1 months ago
2008
IEEE
Production grids are complex and highly variable systems whose behavior is not well understood and difficult to anticipate. The goal of this study is to estimate the impact of the ...
118
click to vote
ICCV
2005
IEEE
16 years 1 months ago
2005
IEEE
In this paper, we address the issue of extracting contour of the object with a specific shape. A hierarchical graphical model is proposed to represent shape variations. A complex ...
ESOP
2005
Springer
15 years 5 months ago
2005
Springer
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...