5699 search results - page 737 / 1140 » Alternating model trees |
199
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
159
click to vote
NAACL
2003
15 years 8 months ago
2003
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...
180
click to vote
AAAI
1996
15 years 8 months ago
1996
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
191
click to vote
ACL
1996
15 years 8 months ago
1996
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...
139
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
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...