Sciweavers

3818 search results - page 312 / 764
» Learning from Order Examples
Sort
View
115
Voted
ACSD
2006
IEEE
118views Hardware» more  ACSD 2006»
15 years 9 months ago
Strategies for Optimised STG Decomposition
— When synthesising an asynchronous circuit from an STG, one often encounters the state explosion problem. In order to alleviate this problem one can decompose the STG into small...
Mark Schäfer, Walter Vogler, Ralf Wollowski, ...
124
Voted
ACL
1992
15 years 4 months ago
An Algorithm for VP Ellipsis
An algorithm is proposed to determine antecedents for VP ellipsis. The algorithm eliminates impossible antecedents, and then imposes a preference ordering on possible antecedents....
Daniel Hardt
135
Voted
ML
2000
ACM
15 years 3 months ago
Maximizing Theory Accuracy Through Selective Reinterpretation
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
Shlomo Argamon-Engelson, Moshe Koppel, Hillel Walt...
92
Voted
ICALT
2007
IEEE
15 years 10 months ago
Semantic processing for text mapping onto information space
This paper reports on an approach which maps documents onto an ontology-based information space in order to provide support for machine-mediated communication. First, a composite ...
Weiqiang Ou, Adel Elsayed
141
Voted
ICDAR
2005
IEEE
15 years 9 months ago
Handwriting Matching and Its Application to Handwriting Synthesis
Since it is extremely expensive to collect a large volume of handwriting samples, synthesized data are often used to enlarge the training set. We argue that, in order to generate ...
Yefeng Zheng, David S. Doermann