Sciweavers

2100 search results - page 38 / 420
» Fundamentals of the problem
Sort
View
COLING
2002
13 years 10 months ago
Applying an NVEF Word-Pair Identifier to the Chinese Syllable-to-Word Conversion Problem
Syllable-to-word (STW) conversion is important in Chinese phonetic input methods and speech recognition. There are two major problems in the STW conversion: (1) resolving the ambi...
Jia-Lin Tsai, Wen-Lian Hsu
ISSAC
2004
Springer
91views Mathematics» more  ISSAC 2004»
14 years 3 months ago
A poly-algorithmic approach to simplifying elementary functions
Simplification has been long recognised to be a fundamental problem within computer algebra[17]. However, even for the class of elementary functions, it has not been resolved in ...
James C. Beaumont, Russell J. Bradford, James H. D...
FSTTCS
2010
Springer
13 years 8 months ago
Computing Rational Radical Sums in Uniform TC^0
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
Paul Hunter, Patricia Bouyer, Nicolas Markey, Jo&e...
SKG
2006
IEEE
14 years 4 months ago
Completeness of Query Operations on Resource Spaces
A great variety of languages can be designed by different people for different purposes to operate resource spaces. Two fundamental issues are: can we design more operations in ad...
Hai Zhuge, Erlin Yao
ADVIS
2000
Springer
14 years 2 months ago
What Do Hyperlink-Proposals and Request-Prediction Have in Common?
This paper focuses on fundamental similarities between proposing links for hypertexts and predicting user-requests. It briefly outlines the theoretical background of both categorie...
Ernst Georg Haffner, Uwe Roth, Andreas Heuer 0002,...