Sciweavers

438 search results - page 9 / 88
» The forest hiding problem
Sort
View
ICPR
2006
IEEE
16 years 26 days ago
Forest Extension of Error Correcting Output Codes and Boosted Landmarks
In this paper, we introduce a robust novel approach for detecting objects category in cluttered scenes by generating boosted contextual descriptors of landmarks. In particular, ou...
Oriol Pujol, Petia Radeva, Sergio Escalera
AMC
2005
95views more  AMC 2005»
14 years 11 months ago
Detection and continuation of a border collision bifurcation in a forest fire model
The behavior of the simplest forest fire model is studied in this paper through bifurcation analysis. The model is a second-order continuous-time impact model where vegetational g...
Fabio Dercole, Stefano Maggi
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 4 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
ENVSOFT
2007
76views more  ENVSOFT 2007»
14 years 11 months ago
Biocomplexity of deforestation in the Caparo tropical forest reserve in Venezuela: An integrated multi-agent and cellular automa
A multi-agent model of social and environmental complexity of deforestation was developed for the Caparo Forest Reserve, Venezuela. It includes three types of agents: settlers, go...
Niandry Moreno, Raquel Quintero, Magdiel Ablan, Ro...
DAC
2009
ACM
15 years 6 months ago
Information hiding for trusted system design
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
Junjun Gu, Gang Qu, Qiang Zhou