Sciweavers

438 search results - page 14 / 88
» The forest hiding problem
Sort
View
ICCV
2009
IEEE
16 years 4 months ago
Semi-Supervised Random Forests
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...
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
15 years 3 months ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
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...
Chung Keung Poon, Vijaya Ramachandran
70
Voted
DAGSTUHL
2007
15 years 1 months ago
Agents, Norms and Forest Cleaning
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...
Jan Odelstad
AVI
2008
15 years 2 months ago
Time2Hide: spatial searches and clutter alleviation for the desktop
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...
ICIP
2005
IEEE
16 years 1 months ago
Hiding privacy information in video surveillance system
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 ...
Wei Zhang, Sen-Ching S. Cheung, Minghua Chen