10493 search results - page 125 / 2099 » Dynamic Word Problems |
144
click to vote
JCAM
2010
14 years 9 months ago
2010
Fornberg and Meyer-Spasche proposed some time ago a simple strategy to correct finite difference schemes in the presence of a free boundary that cuts across a Cartesian grid. We sh...
167
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
FUN
2007
Springer
15 years 6 months ago
2007
Springer
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
132
click to vote
KES
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents a new learning method for automatic acquisition of translation knowledge from parallel corpora. We apply this learning method to automatic extraction of bilingu...
ACL
1998
15 years 3 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...