Sciweavers

1343 search results - page 35 / 269
» Learning to Complete Sentences
Sort
View
WEBI
2010
Springer
15 years 2 months ago
Relations Expansion: Extracting Relationship Instances from the Web
In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a set of sentences containing target relations. Duri...
Haibo Li, Yutaka Matsuo, Mitsuru Ishizuka
ICDS
2010
IEEE
15 years 9 months ago
Towards Learning Domain Ontology from Legacy Documents
—Learning ontology from text is a challenge in knowledge engineering research and practice. Learning relations between concepts is even more difficult work. However, when conside...
Yijian Wu, Shaolei Zhang, Wenyun Zhao
ICASSP
2011
IEEE
14 years 8 months ago
Reconstructing completely overlapped notes from musical mixtures
In mixtures of musical sounds, the problem of overlapped harmonics poses a significant challenge to source separation. Common Amplitude Modulation (CAM) is one of the most effect...
Jinyu Han, Bryan Pardo
ICDAR
2009
IEEE
15 years 11 months ago
Isolated Handwritten Farsi Numerals Recognition Using Sparse and Over-Complete Representations
A new isolated handwritten Farsi numeral recognition algorithm is proposed in this paper, which exploits the sparse and over-complete structure from the handwritten Farsi numeral ...
Wumo Pan, Tien D. Bui, Ching Y. Suen
AIIA
2003
Springer
15 years 9 months ago
A Complete Subsumption Algorithm
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
Stefano Ferilli, Nicola Di Mauro, Teresa Maria Alt...