نتایج جستجو برای: who though many efforts

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

Journal: :international journal of agricultural science, research and technology in extension and education systems 2011
workneh abebe ranjan s. karippai ranjitha puskur

though beekeeping is a common farming enterprise and income generating activity in atsbi wemberta district, and promotional efforts have been made to improve it, no systematic study has been undertaken to evaluate the promotional efforts and people’s response to it. the objectives of this study were to identify determinants of improved box hive adoption by the beekeepers; and to analyze financi...

2006
Ali Shokoufandeh Yakov Keselman M. Fatih Demirci Diego Macrini Sven J. Dickinson

One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the generic object recognition task where, for example, a collection of features at one scale (in one image) may correspond to a single feature at a coarser scale (in the second image). Generic object recognition therefore req...

2007
Youssef Bououlid Idrissi Julie Vachon

Semantic matching is a fundamental step in implementing data sharing applications. Most systems automating this task however limit themselves to finding simple (one-to-one) matching. In fact, complex (many-to-many) matching raises a far more difficult problem as the search space of concept combinations is often very large. This article presents Indigo, a system discovering complex matching in t...

1995
Leila Kosseim Guy Lapalme

In this paper, we address the problem of planning the textual organization of instructions. We take the view that natural language generation (NLG) is a mapping process of diierent levels of conceptual and textual representations. Within this framework , we consider the mapping between the text's semantic representation and its rhetorical structure. We argue that such a mapping is not direct, b...

2010

Today’s embedded system developers face unprecedented challenges in their efforts to rapidly deliver competitive products to market. Until recently, most system implementation options have been limited to software-intensive, power-hungry multichip systems or costly SoC ASICs. However, market forces and resource constraints are compounding to make these approaches less viable for many design tea...

2004
Erfu Yang Dongbing Gu

Multiagent reinforcement learning for multirobot systems is a challenging issue in both robotics and artificial intelligence. With the ever increasing interests in theoretical researches and practical applications, currently there have been a lot of efforts towards providing some solutions to this challenge. However, there are still many difficulties in scaling up the multiagent reinforcement l...

2013
Tobias Chirwa Peter Nyasulu Esnat Chirwa Akeem Ketlogetswe George Bello Isiah Dambe Dennis Ndalama Martias Joshua

BACKGROUND Despite great efforts to control Tuberculosis (TB), progress is compromised by low adherence to medication, leading to prolonged duration of infectiousness and continued transmission. Investigating low adherence is of high importance from TB programmatic perspective. Though data on actual days of missed treatment exist, the effect of such on TB cure rates has not been investigated. ...

Journal: :Discrete Mathematics 2016
Hyeong-Seok Lim Hee-Chul Kim Jung-Heum Park

A many-to-many k-disjoint path cover of a graph joining two disjoint vertex subsets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. It is classified as paired if each source in S is required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we develop Ore-type sufficient conditions for the ...

2014
Manuela Sanguinetti Cristina Bosco Loredana Cupi

This paper aims to introduce the issues related to the syntactic alignment of a dependency-based multilingual parallel treebank, ParTUT. Our approach to the task starts from a lexical mapping and then attempts to expand it using dependency relations. In developing the system, however, we realized that the only dependency relations between the individual nodes were not sufficient to overcome som...

2011
Mike Tian-Jian Jiang Chan-Hung Kuo Wen-Lian Hsu

This work presents a grapheme-based approach of English-to-Chinese (E2C) transliteration, which consists of many-to-many (M2M) alignment and conditional random fields (CRF) using accessor variety (AV) as an additional feature to approximate local context of source graphemes. Experiment results show that the AV of a given English named entity generally improves effectiveness of E2C transliteration.

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

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