Sciweavers

2713 search results - page 276 / 543
» Parameterized Tree Systems
Sort
View
ASPDAC
2006
ACM
122views Hardware» more  ASPDAC 2006»
16 years 17 days ago
Reusable component IP design using refinement-based design environment
- We propose a method of enhancing the reusability of the component IPs by separating communication and computation for a system function. In this approach, we assume that the comp...
Sanggyu Park, Sang-yong Yoon, Soo-Ik Chae
LICS
2005
IEEE
16 years 5 days ago
Proof Theory for Kleene Algebra
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...
Chris Hardin
EMNLP
2007
15 years 8 months ago
Determining Case in Arabic: Learning Complex Linguistic Behavior Requires Complex Linguistic Features
This paper discusses automatic determination of case in Arabic. This task is an important part and major source of errors in full diacritization of Arabic. We use a goldstandard s...
Nizar Habash, Ryan Gabbard, Owen Rambow, Seth Kuli...

Book
498views
17 years 4 months ago
Machine Learning, Neural and Statistical Classification
This book covers several topics such as Classification, Classical Statistical Methods, Modern Statistical Techniques, Machine Learning of Rules and Trees, Neural Networks Methods ...
Ellis Horwood
SSS
2005
Springer
16 years 2 days ago
Synchronous vs. Asynchronous Unison
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...
Christian Boulinier, Franck Petit, Vincent Villain