17049 search results - page 216 / 3410 » cans 2007 |
125
click to vote
ACL
1996
15 years 5 months ago
1996
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, ...
142
click to vote
ACL
1994
15 years 5 months ago
1994
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
132
click to vote
ACL
1996
15 years 5 months ago
1996
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
117
click to vote
CASCON
1993
15 years 5 months ago
1993
When debugging a distributed application, a display showing the events causing interactions between processes can be very useful. If the number of processes is large, displaying a...
130
click to vote
CCCG
1993
15 years 5 months ago
1993
In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the rob...