Sciweavers

2553 search results - page 394 / 511
» Modeling Trees with Hypertextures
Sort
View
NAACL
2003
14 years 11 months ago
A Context-Sensitive Homograph Disambiguation in Thai Text-to-Speech Synthesis
Homograph ambiguity is an original issue in Text-to-Speech (TTS). To disambiguate homograph, several efficient approaches have been proposed such as part-of-speech (POS) n-gram, B...
Virongrong Tesprasit, Paisarn Charoenpornsawat, Vi...
AAAI
1996
14 years 11 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
ACL
1996
14 years 11 months ago
A New Statistical Parser Based on Bigram Lexical Dependencies
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniqu...
Michael Collins
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
14 years 11 months ago
Accelerating genetic programming by frequent subtree mining
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...
Yoshitaka Kameya, Junichi Kumagai, Yoshiaki Kurata
AIEDAM
2008
127views more  AIEDAM 2008»
14 years 10 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter