16430 search results - page 476 / 3286 » On Computable Tree Functions |
181
click to vote
ICMI
2003
Springer
16 years 4 days ago
2003
Springer
The major difficulty for large vocabulary sign language or gesture recognition lies in the huge search space due to a variety of recognized classes. How to reduce the recognition ...
198
click to vote
EICS
2010
ACM
16 years 19 hour ago
2010
ACM
Web applications such as web-based email, spreadsheets and form filling applications have become ubiquitous. However, many of the tasks that users try to accomplish with such web ...
164
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
187
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
195
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...