نتایج جستجو برای: cover analysis

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

2009
Johan Bergstedt Lars Westerberg Per Milberg

Cover estimates by eye is a prevailing method to assess abundance. We examined cover estimates with regard to bias and random variation. Ten observers working with a national forest vegetation survey estimated sixteen 100 m 2 -plots, placed in two different vegetation types. These had similar species composition but were clearly distinguishable in the field. In specieswise analyses, observer bi...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه رازی - پژوهشکده ادبیات 1389

the present study reports an analysis of response articles in four different disciplines in the social sciences, i.e., linguistics, english for specific purposes (esp), accounting, and psychology. the study has three phases: micro analysis, macro analysis, and e-mail interview. the results of the micro analysis indicate that a three-level linguistic pattern is used by the writers in order to cr...

2001
Ian Douglas Sanders Leigh-Ann Kenny

This research extends on previous work which has its origin in a method, Space Syntax Analysis [2], to describe and analyse patterns of architectural space – both at the building and urban level. In the process of applying space syntax analysis [3] the space (roads, parks, etc.) in the town is partitioned into the smallest number of convex polygons to cover the whole town. Then the axial lines ...

2017
Lin Yang Yizhe Zhang Jianxu Chen Siyuan Zhang Danny Ziyi Chen

Image segmentation is a fundamental problem in biomedical image analysis. Recent advances in deep learning have achieved promising results on many biomedical image segmentation benchmarks. However, due to large variations in biomedical images (different modalities, image settings, objects, noise, etc), to utilize deep learning on a new application, it usually needs a new set of training data. T...

Journal: :Algorithmic Operations Research 2009
Giorgio Ausiello Nicolas Bourgeois Aristotelis Giannakos Vangelis Th. Paschos

We study on-line models for the set-covering problem in which items from a ground set arrive one by one and with any such item c, the list of names of sets that contain it in the final instance is also presented possibly together with some information regarding the content of such sets. A decision maker has to select which set, among the sets containing c, has to be put in the solution in order...

Journal: :Remote Sensing 2016
Stephen J. Leisz Eric Rounds Ngo The An Nguyen Thi Bich Yen Tran Nguyen Bang Souvanthone Douangphachanh Bounheuang Ninchaleune

In recent years, the concepts of teleconnections and telecoupling have been introduced into land-use and land-cover change literature as frameworks that seek to explain connections between areas that are not in close physical proximity to each other. The conceptual frameworks of teleconnections and telecoupling seek to explicitly link land changes in one place, or in a number of places, to dist...

2000
Erik R. Ivins

Assessment of Antarctic rebound is complicated by two issues: (1) The total ice volume at Last Glacial Maximum is contentious, with estimates ranging from just a few meters to several tens of meters of equivalent eustatic sea level rise. (2) The late Holocene mass budget is also uncertain. Space-based geodesy may provide important data in the coming years for estimating the recent ice mass bala...

Journal: :CoRR 2017
S. Ali Saberali Lutz H.-J. Lampe Ian F. Blake

Coded caching is an effective technique to reduce the redundant traffic in wireless networks. The existing coded caching schemes require the splitting of files into a possibly large number of subfiles, i.e., they perform coded subfile caching. Keeping the files intact during the caching process would actually be appealing, broadly speaking because of its simpler implementation. However, little ...

2006
Tin Kam Ho

Studies on ensemble methods for classification suffer from the difficulty of modeling the complementary strengths of the components. Kleinberg’s theory of stochastic discrimination (SD) addresses this rigorously via mathematical notions of enrichment, uniformity, and projectability of a model ensemble. We explain these concepts via a very simple numerical example that captures the basic princip...

2017
Stephane Coulomb Stéphane Coulomb

We study minimal vertex covers of trees. Contrarily to the number Nvc(A) of minimal vertex covers of the tree A, log Nvc(A) is a self-averaging quantity. We show that, for large sizes n, limn→+∞ < log Nvc(A) >n /n = 0.1033252 ± 10−7. The basic idea is, given a tree, to concentrate on its degenerate vertices, that is those vertices which belong to some minimal vertex cover but not to all of them...

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

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