The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
We present the IBM systems submitted and evaluated within the CLEAR'06 evaluation campaign for the tasks of single person visual 3D tracking (localization) and 2D face trackin...
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
This work presents some anticipatory mechanisms in an agent architecture, modeling affective behaviours as effects of surprise. Through experiment discussion, the advantages of bec...
Pervasive Computing has postulated to invisibly integrate technology into everyday objects in such a way, that these objects turn into smart things. Not only a single object of thi...