Sciweavers

933 search results - page 25 / 187
» Fully automatic cross-associations
Sort
View
ACSD
2007
IEEE
109views Hardware» more  ACSD 2007»
15 years 10 months ago
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
Victor Khomenko
ACL
2008
15 years 7 months ago
Unsupervised Discovery of Generic Relationships Using Pattern Clusters and its Evaluation by Automatically Generated SAT Analogy
We present a novel framework for the discovery and representation of general semantic relationships that hold between lexical items. We propose that each such relationship can be ...
Dmitry Davidov, Ari Rappoport
BILDMED
2006
113views Algorithms» more  BILDMED 2006»
15 years 7 months ago
Automatic Segmentation of the Vessel Lumen from 3D CTA Images of Aortic Dissection
Acute aortic dissection is a life-threatening condition and must be diagnosed and treated promptly. For treatment planning the reliable identification of the true and false lumen i...
Tamás Kovács, Philippe C. Cattin, Ha...
ACL
1998
15 years 7 months ago
Automatic Acquisition of Hierarchical Transduction Models for Machine Translation
We describe a method for the fully automatic learning of hierarchical finite state translation models. The input to the method is transcribed speech utterances and their correspon...
Hiyan Alshawi, Srinivas Bangalore, Shona Douglas
COLING
2000
15 years 7 months ago
Automatic Refinement of a POS Tagger Using a Reliable Parser and Plain Text Corpora
This paper proposes a new unsupervised learning method for obtaining English part-ofspecch(POS) disambiguation rules which would improve thc accuracy of a POS tagger. This method ...
Hideki Hirakawa, Kenji Ono, Yumiko Yoshimura