Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
The automation of forest cleaning presupposes principles for choosing those trees that ought to be taken away and those that shall be left standing. In this paper, which is a repor...
The desktop metaphor aimed to create a working environment, which would resemble that of the user's desk. With information abundance this desktop is often cluttered with file...
George Lepouras, Aggelos Papatriantafyllou, Akrivi...
This paper proposes a detailed framework of storing privacy information in surveillance video as a watermark. Authorized personnel is not only removed from the surveillance video ...