intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE

Mô hình space

Xem 1-20 trên 78 kết quả Mô hình space
  • Bài giảng "Toán trong công nghệ - Chương 2: Các khái niệm cơ bản của xác suất" cung cấp cho người học các kiến thức: Thực nghiệm ngẫu nhiên, không gian mẫu (Sample Space), biến cố. Mời các bạn cùng tham khảo nội dung chi tiết.

    pdf24p larachdumlanat128 05-01-2021 11 0   Download

  • Bài viết trình bày và phân tích kỹ thuật MIMO-OFDM VBLAST(Multiple Input Muliple OutputOrthogonal Frequency Division Multiplexing Vertical Bell Laboratories Layered Space Time) cho phép tăng dung lượng và chất lượng của hệ thống một cách đáng kể. Sự thành công của việc kết hợp hệ thống MIMO (Multiple Input Muliple Output) với kỹ thuật OFDM (Orthogonal Frequency Division Multiplexing) đã đưa nó trở thành nền tảng cho sự phát triển của các thế hệ thông tin tiếp theo.

    pdf3p visatori2711 17-04-2019 52 1   Download

  • Báo cáo trình bày việc áp dụng mô hình Markov ẩn phân bố đa không gian Multi Space Distribution Hidden Markov Model (MSD-HMM) cho nhận dạng tiếng Việt. Nghiên cứu đề xuất một kiểu mô hình MSD-HMM để mô hình hoá cho các âm vị có chứa thông tin thanh điệu với đặc trưng đầu vào gồm bốn lớp độc lập.

    pdf11p dieutringuyen 07-06-2017 43 1   Download

  • The aims of thesis: studying of the phase structure of LSM and LSMq with two different forms of symmetry breaking term: the standard case and non – standard case; studying of the effect from neutrality condition on the phase structure of LSM and LSMq; studying of the chiral phase transition in compactified space

    pdf26p fujijudo87 07-07-2014 73 4   Download

  • Trong toán học, một không gian mêtric (tiếng Anh: metric space) là một tập hợp mà trong đó khái niệm về khoảng cách giữa các phần tử được định nghĩa. Không gian mêtric gần nhất với hiểu biết trực quan của con người là không gian Euclid ba chiều. Mêtric Euclid của không gian này định nghĩa khoảng cách giữa hai điểm là độ dài đoạn thẳng nối chúng. Hình học của không gian phụ thuộc vào mêtric được chọn, và bằng các mêtric khác nhau, ta có thể xây dựng các hình học phi Euclid thú vị, chẳng hạn...

    pdf44p dinhvansao 25-05-2013 140 45   Download

  • Hình thức chuyên đề tốt nghiệp phải tuân thủ các quy định sau: - Chuyên đề tốt nghiệp được in ấn và đóng bìa nylon và giấy cứng. - Có số trang tối thiểu 50 trang, không kể phần phụ lục - Font: Times New Roman , size: 13, paragraph – line spacing: 1.5 line, khổ giấy A 4, in 1 mặt. - Số thứ tự trang đánh ở giữa và phía cuối mỗi trang. Được tính là trang 1 khi bắt đầu vào nội dung chính (mở đầu), còn các phần trước đó đánh số thứ tự theo i, ii, iii…...

    doc6p trithanh7 23-05-2013 113 5   Download

  • 240 Võ Văn Ngân, Phường Bình Thọ, Quận Thủ Đức, TpHCM Website: www.ispace.edu.vn   Email: ispace@ispace.edu.vn 

    doc224p vannam114111 22-04-2013 115 37   Download

  • This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explicitly calculated sample complexity learning times under different input distribution assumptions (including CHILDES database language input) and learning regimes. We also briefly describe a new way to formally model (rapid) diachronic syntax change.

    pdf10p bunmoc_1 20-04-2013 41 3   Download

  • Chinese sentences are written with no special delimiters such as space to indicate word boundaries. Existing Chinese NLP systems therefore employ preprocessors to segment sentences into words. Contrary to the conventional wisdom of separating this issue from the task of sentence understanding, we propose an integrated model that performs word boundary identification in lockstep with sentence understanding. In this approach, there is no distinction between rules for word boundary identification and rules for sentence understanding. These two functions are combined. ...

    pdf3p bunmoc_1 20-04-2013 45 1   Download

  • 1 Efficient natural language generation has been successfully demonstrated using highly compiled knowledge about speech acts and their related social actions. A design and prototype implementation of a parser which utilizes this same pragmatic knowledge to efficiently guide parsing is presented. Such guidance is shown to prune the search space and thus avoid needless processing of pragmatically unlikely constituent structures.

    pdf3p bunmoc_1 20-04-2013 46 2   Download

  • This paper presents a method for inducing the parts of speech of a language and partof-speech labels for individual words from a large text corpus. Vector representations for the part-of-speech of a word are formed from entries of its near lexical neighbors. A dimensionality reduction creates a space representing the syntactic categories of unambiguous words. A neural net trained on these spatial representations classifies individual contexts of occurrence of ambiguous words. The method classifies both ambiguous and unambiguous words correctly with high accuracy. ...

    pdf8p bunmoc_1 20-04-2013 43 1   Download

  • Thematic knowledge is a basis of semamic interpretation. In this paper, we propose an acquisition method to acquire thematic knowledge by exploiting syntactic clues from training sentences. The syntactic clues, which may be easily collected by most existing syntactic processors, reduce the hypothesis space of the thematic roles. The ambiguities may be further resolved by the evidences either from a trainer or from a large corpus.

    pdf8p bunmoc_1 20-04-2013 43 1   Download

  • We introduce an algorithm for designing a predictive left to right shift-reduce non-deterministic push-down machine corresponding to an arbitrary unrestricted context-free grammar and an algorithm for efficiently driving this machine in pseudo-parallel. The performance of the resulting parser is formally proven to be superior to Earley's parser (1970). The technique employed consists in constructing before run-time a parsing table that encodes a nondeterministic machine in the which the predictive behavior has been compiled out. ...

    pdf8p bunmoc_1 20-04-2013 49 3   Download

  • Context is used in many NLP systems as an indicator of a term’s syntactic and semantic function. The accuracy of the system is dependent on the quality and quantity of contextual information available to describe each term. However, the quantity variable is no longer fixed by limited corpus resources. Given fixed training time and computational resources, it makes sense for systems to invest time in extracting high quality contextual information from a fixed corpus.

    pdf8p bunmoc_1 20-04-2013 33 2   Download

  • This paper presents a new formalization of a unification- or join-preserving encoding of partially ordered sets that more essentially captures what it means for an encoding to preserve joins, generalizing the standard definition in AI research. It then shows that every statically typable ontology in the logic of typed feature structures can be encoded in a data structure of fixed size without the need for resizing or additional union-find operations.

    pdf8p bunmoc_1 20-04-2013 43 1   Download

  • Lexical selection is a significant problem for widecoverage machine translation: depending on the context, a given source language word can often be translated into different target language words. In this paper I propose a method for target word selection that assumes the appropriate translation is more similar to the translated context than are the alternatives. Similarity of a word to a context is estimated using a proximity measure in corpusderived "semantic space".

    pdf3p bunrieu_1 18-04-2013 47 4   Download

  • We introduce a stochastic grammatical channel model for machine translation, that synthesizes several desirable characteristics of both statistical and grammatical machine translation. As with the pure statistical translation model described by Wu (1996) (in which a bracketing transduction grammar models the channel), alternative hypotheses compete probabilistically, exhaustive search of the translation hypothesis space can be performed in polynomial time, and robustness heuristics arise naturally from a language-independent inversiontransduction model. ...

    pdf8p bunrieu_1 18-04-2013 34 3   Download

  • The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to purely bottom-up, for LIGs and TAGs. The tabular interpretation ensures, for all strategies, a time complexity in O(n 6) and space complexity in O(n 5) where n is the length of the input string.

    pdf7p bunrieu_1 18-04-2013 36 2   Download

  • We present an architecture and an on-line learning algorithm and apply it to the problem of part-ofspeech tagging. The architecture presented, SNOW, is a network of linear separators in the feature space, utilizing the Winnow update algorithm. Multiplicative weight-update algorithms such as Winnow have been shown to have exceptionally good behavior when applied to very high dimensional problems, and especially when the target concepts depend on only a small subset of the features in the feature space. ...

    pdf7p bunrieu_1 18-04-2013 52 3   Download

  • Nonconcatenative constraints, such as the shuffle relation, are frequently employed in grammatical analyses of languages that have more flexible ordering of constituents than English. We show how it is possible to avoid searching the large space of permutations that results from a nondeterministic application of shuffle constraints. The results of our implementation demonstrate that deterministic application of shuffle constraints yields a dramatic improvement in the overall performance of a head-corner parser for German using an HPSG-style grammar.

    pdf7p bunrieu_1 18-04-2013 53 4   Download

CHỦ ĐỀ BẠN MUỐN TÌM

ADSENSE

nocache searchPhinxDoc

 

Đồng bộ tài khoản
2=>2