نتایج جستجو برای: generate large candidate path sets
تعداد نتایج: 1546478 فیلتر نتایج به سال:
A common approach to the recognition of text (handwritten or machineprinted) is to generate a set of candidate words for each unknown word in the input. The resulting sequence of word candidate sets may then be further disambiguated by applying contextual knowledge in the form of a language model. This paper describes language models derived from large text corpora and demonstrates the performa...
Lack of reproducibility of findings has been a criticism of genetic association studies on complex diseases, such as chronic obstructive pulmonary disease (COPD). We selected 257 polymorphisms of 16 genes with reported or potential relationships to COPD and genotyped these variants in a case-control study that included 953 COPD cases and 956 control subjects. We explored the association of thes...
Most of the algorithms for discovering association rules require multiple passes over the database resulting in a large number of disk reads and placing a huge burden on the I/O subsystem [1]. To reduce this bottleneck in case of large databases, a new association rule mining algorithm, which uses both the Partition and the Apriori approach for calculating the frequent item sets in a single pas...
Subset selection plays an important role in the field of evolutionary multiobjective optimization (EMO). Especially, EMO algorithm with unbounded external archive (UEA), subset is essential post-processing procedure to select a prespecified number solutions as final result. In this article, we discuss efficiency greedy for hypervolume, inverted generational distance (IGD), and IGD plus (IGD+) i...
In this paper we present an approach to generate document filtered sets using information retrieval techniques. This is presented in the context of external document plagiarism detection, although the techniques detailed in this paper are applicable to any sort of documents or queries. Producing filtered sets, and hence limiting the problem’s search space, can be a tremendous performance improv...
This paper presents a new algorithm for solving the Traveling Salesman Problem (NPhard problem) using pheromone of ant colony depends on the pheromone and path between cites. TSP is a problem in theoretical computer science which is very hard to solve a number of real-world problems can be formalized as TSP problems, and ants of the colony are able to generate successively shorter feasible tour...
a shortest path problem is a practical issue in networks for real-world situations. this paper addresses the fuzzy shortest path (fsp) problem to obtain the best fuzzy path among fuzzy paths sets. for this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (ifss) in order to determine the fuzzy shortest path. moreover, this algorithm is developed for ...
To resolve the local path generating problem for unmanned ground vehicles (UGV) in unstructured environments, a method combining a basic path subdivision method for topological maps of local environments and a Support Vector Machine (SVM) is proposed in this paper. Based on the basic path subdivision method, topological maps of local environments can be extrac...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید