نتایج جستجو برای: oriented cycledouble cover

تعداد نتایج: 236824  

2004
Noriko Onishi Takuhiko Murakami Nobuya Mizoue

In order to comprehend detailed forest resources, the use of high spatial resolution data is expected. However, the efficeint forest cover type classification method of high spatial resolution data is not cleared yet. So, this study discussed the potential of the forest cover type classification such as classification of coniferous forest, broadleaved forest, and mixed forest, and tree speices ...

Journal: Geopersia 2011
- -

Geopersia is published biannually by the College of Science, University of Tehran, Iran. The College of Science published Journal of Science, which covered all fields of basic science, from 1968 to 2010. It was then decided that the College’s journals should be more specialized, and hence publication of Geopersia was launched. Articles printed in Geopersia will be available online too. Aims an...

Journal: Geopersia 2012
cover cover

cover

1997
Victor Ivannikov K. V. Dyshlevoi V. E. Kamensky A. V. Klimov S. G. Manzheley V. A. Omelchenko L. B. Solovskaya A. A. Vinokurov

Many problems of distributed object-oriented applications can be uniformly resolved in the frame of approach based on the concept of cover. The cover is defined as an environment which transparently controls all aspects of object’s community life: creation, interaction etc. To enable transparency, an objectoriented application must obey a principle of late binding, a reference to server object ...

Journal: :جغرافیا و برنامه ریزی محیطی 0

0

2012
Ning Chen Pinyan Lu Hongyang Zhang

In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable solution for the grand coalition. We study the computation of the nucleolus of a number of cooperative games, including fractional matching games and fractional edge cover games on general weighted graphs, as well as verte...

Journal: :Discrete Optimization 2011
Peter Damaschke

Motivated by the need for succinct representations of all “small” transversals (or hitting sets) of a hypergraph of fixed rank, we study the complexity of computing such a representation. Next, the existence of a minimal hitting set of at least a given size arises as a subproblem. We give one algorithm for hypergraphs of any fixed rank, and we largely improve an earlier algorithm (by H. Fernau,...

Journal: :Theor. Comput. Sci. 2015
Henning Fernau Fedor V. Fomin Geevarghese Philip Saket Saurabh

Article history: Received 21 October 2013 Received in revised form 30 September 2014 Accepted 21 October 2014 Available online 28 October 2014 Communicated by G. Ausiello

2011
S. J. Lee T. Longcore J. P. Wilson

Nature’s services provided by green cover are important to environmental conditions in cities and their ability to adapt to climate change. Researchers using geospatial technologies have dramatically increased the spatial and temporal resolution of knowledge about the distribution of tree and shrub cover in cities. Much of the current research on tree cover in cities has concentrated on individ...

2005
Matthew D. Dunbar Mark E. Jakubauskas Stephen L. Egbert Jerome E. Dobson

Matthew D. Dunbar, M.A. Department of Geography, May 2005 University of Kansas Woody species can rapidly invade grassland habitats that are not burned, grazed, cultivated or mowed along the prairie-forest boundary, where it has been suggested that forest expansion has occurred within the last 100 years. Considering this dynamic environment, there is a need for detailed landscape-level analysis ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید