a license plate recognition algorithm for intelligent transportation system applications pdf

Tài liệu Báo cáo khoa học: "A Best-First Search Algorithm for Generating Referring Expressions" pot

Tài liệu Báo cáo khoa học: "A Best-First Search Algorithm for Generating Referring Expressions" pot

Ngày tải lên : 22/02/2014, 02:20
... reduce this search space, but we also avoid strong commitments. 3 The Algorithm at a Glance Basically, the best-first search algorithm is a generalization of the incremental version: instead of successively ... generated so far, augmented by the minimal value of the description required for excluding the remaining potantial distractors, surpasses the evaluation of the best solution. 4 Formalization ... secretary". In the second example, x5, x6, x9, and xio are the intended referents. After picking white as a descriptor, the incremental algorithm can choose from many alternatives for...
  • 4
  • 672
  • 3
Báo cáo khoa học: "A Beam-Search Extraction Algorithm for Comparable Data" pptx

Báo cáo khoa học: "A Beam-Search Extraction Algorithm for Comparable Data" pptx

Ngày tải lên : 17/03/2014, 02:20
... et al., 2008; Utiyama and Isahara, 2003; Munteanu and Marcu, 2005; Fung and Cheung, 2004). The novel algorithm is successfully eval- uated on news data for two language pairs. A related approach ... com- parable data (Munteanu and Marcu, 2005). For a given source sentence S, a max- imum entropy (ME) classifier is applied to a large set of candidate target transla- tions . A beam-search algorithm ... 2004. Pharaoh: a Beam Search De- coder for Phrase-Based Statistical Machine Transla- tion Models. In Proceedings of AMTA’04, Washing- ton DC, September-October. Dragos S. Munteanu and Daniel Marcu....
  • 4
  • 404
  • 0
Báo cáo khoa học: "A Progressive Feature Selection Algorithm for Ultra Large Feature Spaces" doc

Báo cáo khoa học: "A Progressive Feature Selection Algorithm for Ultra Large Feature Spaces" doc

Ngày tải lên : 17/03/2014, 04:20
... (CoNLL-2002), 49-55, Taibei, Taiwan. Mari Ostendorf, Izhak Shafran, Stefanie Shattuck- Hufnagel, Leslie Charmichael, and William Byrne. 2001. A Prosodically Labeled Database of Sponta- neous Speech. ... Preposi- tional Phrase Attachment. In Proceedings of the ARPA Workshop on Human Language Technology, 250-255, Plainsboro, NJ, USA. Jeffrey C. Reynar and Adwait Ratnaparkhi. 1997. A Maximum Entropy Approach ... area (Ratnaparkhi et al., 1994; Ber- ger et al., 1996; Pietra et al, 1997; Zhou et al., 2003; Riezler and Vasserman, 2004) In the most basic approach, such as Ratna- parkhi et al. (1994) and...
  • 8
  • 388
  • 0
Báo cáo khoa học: "A Morphologically Sensitive Clustering Algorithm for Identifying Arabic Roots" docx

Báo cáo khoa học: "A Morphologically Sensitive Clustering Algorithm for Identifying Arabic Roots" docx

Ngày tải lên : 17/03/2014, 07:20
... semantically related pairs of words and document titles. Information Storage and Retrieval,. Vol 10, pp 253-260 Al-Fedaghi Sabah S. and Fawaz Al-Anzi (1989) A new algorithm to generate Arabic ... of Computational Arabic Morphology. DATR Documentation Report, University of Sussex. Al-Raya (1997) Newspaper. Quatar. Al-Shalabi, R. and M. Evens (1998) A Computational Morphology System for Arabic. Proceedings ... stems, and roots as Index terms in an Arabic Information Retrieval system. Journal of the American Society for Information Science, 45/8, pp. 548-560 Al-Najem, Salah R. (1998). An Explanation...
  • 8
  • 263
  • 0
Báo cáo khoa học: " A simple pattern-matching algorithm for recovering empty nodes and their antecedents∗" pot

Báo cáo khoa học: " A simple pattern-matching algorithm for recovering empty nodes and their antecedents∗" pot

Ngày tải lên : 17/03/2014, 08:20
... recall measures for evaluating parse accuracy do not mea- sure the accuracy of empty node and antecedent re- covery, but there is a fairly straightforward extension of them that can evaluate ... A pattern extracted from the tree displayed in Figure 1. accuracy of transitivity labelling was not systemati- cally evaluated here. 2.2 Patterns and matchings Informally, patterns are minimal ... knowledge than the pattern-matching algorithm described here. This algorithm is both simple and general, and can serve as a benchmark against which more complex ap- proaches can be evaluated. NP NP DT the NN man SBAR S NP NNP Sam VP VBZ...
  • 8
  • 346
  • 0
Báo cáo khoa học: "A Trainable Rule-based Algorithm for Word Segmentation" pdf

Báo cáo khoa học: "A Trainable Rule-based Algorithm for Word Segmentation" pdf

Ngày tải lên : 17/03/2014, 23:20
... before AB any Move from after trigram ABC to before ABC any Figure 1: Possible transformations. A, B, C, J, and K are specific characters; x and y can be any character. ~J and ~K can be any character ... that character and begins the search starting at the next character. In this manner, an initial segmen- tation can be obtained that is more informed than a simple character-as-word approach. ... the train- ing data, our rule-based algorithm is able to produce a series of transformations with a high segmentation accuracy. 3.2.2 Maximum matching (greedy) algorithm A common approach...
  • 8
  • 470
  • 0
Báo cáo khoa học: "A Polynomial-Time Parsing Algorithm for TT-MCTAG" pot

Báo cáo khoa học: "A Polynomial-Time Parsing Algorithm for TT-MCTAG" pot

Ngày tải lên : 23/03/2014, 16:21
... deal with all natural language phenomena. This has been argued for tree-local and even set-local MCTAG on the basis of scrambling data from lan- guages such as German (Becker et al., 1992; Ram- bow, ... On matrix languages. Information and Control, 23:86–96. Aravind K. Joshi and Yves Schabes. 1997. Tree- Adjoning Grammars. In G. Rozenberg and A. Salo- maa, editors, Handbook of Formal Languages, ... from a first inspection of the MC- TAG analyses proposed for natural languages (see Chen-Main and Joshi (2007) for an overview), it seems that there are no important natural language phenomena that...
  • 9
  • 259
  • 0
A fast quantum mechanical algorithm for database search pptx

A fast quantum mechanical algorithm for database search pptx

Ngày tải lên : 30/03/2014, 13:20
... 4 state system is of the form: , where and are arbitrary real numbers. Note that, unlike the Walsh-Hadamard transformation and other state transition matrices, the probability in each state stays ... related operation called the Fourier Transformation) is one of the things that makes quantum mechanical algorithms more pow- erful than classical algorithms and forms the basis for most significant ... = Pv v Dv v i – 2A+ ( ) A A v i –( )+( ) 1 N N 1–( ) 2C 2 N A B C D A B C D Average (α) Average (α) (before) (after) (before) (after) Average Average 2 ence, it is natural to ask - how fast can the basic...
  • 8
  • 389
  • 1
Báo cáo khoa học: "A Discriminative Global Training Algorithm for Statistical MT" potx

Báo cáo khoa học: "A Discriminative Global Training Algorithm for Statistical MT" potx

Ngày tải lên : 31/03/2014, 01:20
... Franz J. Och, and Daniel Marcu. 2003. Statistical phrase-based translation. In HLT-NAACL 2003: Main Proceedings, pages 127–133, Edmon- ton, Alberta, Canada, May 27 - June 1. Shankar Kumar and ... 1993. The Mathematics of Statistical Machine Translation: Pa- rameter Estimation. CL, 19(2):263–311. David Chiang. 2005. A hierarchical phrase-based model for statistical machine translation. In ... similar to sequen- tial natural language annotation problems such as part-of-speech tagging and shallow parsing, and the novel training algorithm presented in this pa- per is actually most similar...
  • 8
  • 278
  • 0
báo cáo hóa học: " ZAP: a distributed channel assignment algorithm for cognitive radio networks" pot

báo cáo hóa học: " ZAP: a distributed channel assignment algorithm for cognitive radio networks" pot

Ngày tải lên : 21/06/2014, 02:20
... Centralized Tabu-Based Algorithm (CTBA) [6] and a random channel attribution method (RANDOM).Weevaluatetheperformanceofchannel assignment by analyzing the percentage of removed interference achieved ... used, as it is able to accurately approximate the beha- vior of a fading radio channel in burst applications. Parameters were adjusted so that the GE model yields 5% average packet loss and loss bursts ... in ACM MobiHoc,68–77 (2005) 22. S Avallone, IF Akyildiz, G Ventre, A channel and rate assignment algorithm and a layer-2.5 forwarding paradigm for multi-radio wireless mesh networks. IEEE/ACM...
  • 11
  • 292
  • 0

Xem thêm