منابع مشابه
Fast Ray-Tetrahedron Intersection Using Plucker Coordinates
We present an algorithm for ray–tetrahedron intersection. The algorithm uses Plücker coordinates to represent the ray and the edges of the tetrahedron and employs a robust and efficient test to determine the intersection. The algorithm is highly optimized and provides a significant performance increase over related algorithms.
متن کاملChinese Comma Disambiguation for Discourse Analysis
The Chinese comma signals the boundary of discourse units and also anchors discourse relations between adjacent text spans. In this work, we propose a discourse structureoriented classification of the comma that can be automatically extracted from the Chinese Treebank based on syntactic patterns. We then experimented with two supervised learning methods that automatically disambiguate the Chine...
متن کاملAutomatic Comma Insertion for Japanese Text Generation
This paper proposes a method for automatically inserting commas into Japanese texts. In Japanese sentences, commas play an important role in explicitly separating the constituents, such as words and phrases, of a sentence. The method can be used as an elemental technology for natural language generation such as speech recognition and machine translation, or in writing-support tools for non-nati...
متن کاملComma checking in Danish
This paper describes research in using the Brill tagger (Brill 94,95) to learn to identify incorrect commas in Danish. Trained on a part-of-speech tagged corpus of 600,000 words, the system identifies incorrect commas with a precision of 91% and a recall of 77%. The system was developed by randomly inserting commas in a text, which were tagged as incorrect, while the original commas were tagged...
متن کاملBinary templates for comma-free DNA codes
Arita and Kobayashi proposed a method for constructing comma-free DNA codes using binary templates, and showed that the separation d of any such binary template of length n satisfies d n/2. Kobayashi, Kondo andArita later produced an infinite family of binary templates with d 11n/30. Here we demonstrate the existence of an infinite family of binary templates with d >n/2 − (18n loge n) 1/2. We a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Communications
سال: 1977
ISSN: 1051-0834
DOI: 10.4148/1051-0834.1923