In 2000, Gottlob et al. [3] introduced a new graph parameter, the hypertree width, and showed that it provides a broader characterization of tractable constraint networks than the treewidth. In 2005 this observation was extended to general graphical models [5], showing that the hypertree width yields bounds on inference algorithms. This paper explores further the practical properties of the hyp...

This paper presents a new and original approach for computing the high-frequency radar cross section (RCS) of complex radar targets in real time with a 3-D graphics workstation. The aircraft is modeled with I-DEAS solid modeling software using a parametric surface approach. High-frequency RCS is obtained through physical optics (PO), method of equivalent currents (MEC), physical theory of diffr...

This paper presents a technique to estimate missing depth information obtained from the Microsoft Kinect. Due to the limitations of the depth sensing technology used by the Kinect, a significant loss and noise incurs when capturing depth information. The paper describes the steps needed to go from raw depth, as captured by Kinect, to a point cloud representation of the recovered missing data. O...

Quantum computers aim to achieve a huge reduction of the time required for solving problems with an exponential complexity, but their simulation in conventional computers results itself on a problem with a similar complexity. As this limits considerably the dimensions of the quantum computer we can simulate, multiprocessor architectures are an almost obliged tool when tackling with such simulat...

This chapter faces the All-Pair Shortest-Path problem for sparse graphs combining parallel algorithms and parallel-productivity methods in heterogeneous systems. As this problem can be divided into independent Single-Source ShortestPath subproblems, we distribute this computation space into different processing units, CPUs and graphical processing units (GPUs), that are usually present in moder...

Using FPGAs as hardware accelerators that communicate with a central CPU is becoming a common practice in the embedded design world but there is no standard methodology and toolset to facilitate this path yet. On the other hand, languages such as CUDA and OpenCL provide standard development environments for Graphical Processing Unit (GPU) programming. FASTCUDA is a platform that provides the ne...

New paradigms for parallel programming have been devised to simplify software development on multi-core processors and many-core graphical processing units (GPU). Despite their obvious benefits, the parallelisation of existing computer programs is not an easy task. In this work, the use of the Open Multiprocessing (OpenMP) and Open Computing Language (OpenCL) frameworks is considered for the pa...

Scale Invariant Feature Transform (SIFT) is a popular image feature extraction algorithm. SIFT’s features are invariant to many image related variables including scale and change in viewpoint. Despite its broad capabilities, it is computationally expensive. This characteristic makes it hard for researchers to use SIFT in their works especially in real time application. This is a common problem ...