438 search results - page 6 / 88 » The forest hiding problem |
PAAMS
2010
Springer
14 years 7 months ago
2010
Springer
In this study, a new organization based system for forest fires prediction is presented. It is an Organization Based System for Forest Fires Forecasting (OBSFFF). The core of the s...
ICIP
2003
IEEE
15 years 2 months ago
2003
IEEE
We consider the problem of hiding images in images. In addition to the usual design constraints such as imperceptible host degradation and robustness in presence of variety of att...
80
Voted
WG
2010
Springer
14 years 7 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
ARSCOM
2002
14 years 9 months ago
2002
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
RANDOM
1999
Springer
15 years 1 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...