Sciweavers

3653 search results - page 496 / 731
» On Recognizable Timed Languages
Sort
View
PEPM
1995
ACM
15 years 10 months ago
Shape Analysis as a Generalized Path Problem
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
Thomas W. Reps
TAPSOFT
1991
Springer
15 years 10 months ago
Type Inference with Inequalities
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
Michael I. Schwartzbach
AAAI
2007
15 years 9 months ago
Learning and Inference for Hierarchically Split PCFGs
Treebank parsing can be seen as the search for an optimally refined grammar consistent with a coarse training treebank. We describe a method in which a minimal grammar is hierarc...
Slav Petrov, Dan Klein
ASPDAC
2005
ACM
153views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Design of clocked circuits using UML
– Clocking is an essential component of any embedded system design. However, traditional design techniques are either short of clocking support or too complex for users. The Unif...
Zhenxin Sun, Weng-Fai Wong, Yongxin Zhu, Santhosh ...
ACL
2007
15 years 8 months ago
Semantic Transliteration of Personal Names
Words of foreign origin are referred to as borrowed words or loanwords. A loanword is usually imported to Chinese by phonetic transliteration if a translation is not easily availa...
Haizhou Li, Khe Chai Sim, Jin-Shea Kuo, Minghui Do...