Sciweavers

3653 search results - page 464 / 731
» On Recognizable Timed Languages
Sort
View
PPOPP
2012
ACM
14 years 2 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
ACL
2012
13 years 9 months ago
Applications of GPC Rules and Character Structures in Games for Learning Chinese Characters
We demonstrate applications of psycholinguistic and sublexical information for learning Chinese characters. The knowledge about the grapheme-phoneme conversion (GPC) rules of lang...
Wei-Jie Huang, Chia-Ru Chou, Yu-Lin Tzeng, Chia-Yi...
ACL
2012
13 years 9 months ago
PORT: a Precision-Order-Recall MT Evaluation Metric for Tuning
Many machine translation (MT) evaluation metrics have been shown to correlate better with human judgment than BLEU. In principle, tuning on these metrics should yield better syste...
Boxing Chen, Roland Kuhn, Samuel Larkin
ICALP
2009
Springer
16 years 7 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
ASPLOS
2009
ACM
16 years 7 months ago
Accelerating critical section execution with asymmetric multi-core architectures
To improve the performance of a single application on Chip Multiprocessors (CMPs), the application must be split into threads which execute concurrently on multiple cores. In mult...
M. Aater Suleman, Onur Mutlu, Moinuddin K. Qureshi...