96 search results - page 5 / 20 » Ordering Constraints over Feature Trees |
ISQED
2003
IEEE
14 years 26 days ago
2003
IEEE
This paper addresses a low-cost and real-time solution for the implementation of super-resolution (SR) algorithms over SOC (System-On-Chip) platforms in order to achieve high-qual...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
CICLING
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The purpose of information extraction (IE) is to find desired pieces of information in natural language texts and store them in a form that is suitable for automatic pro...
LREC
2010
13 years 9 months ago
2010
The task of parse disambiguation has gained in importance over the last decade as the complexity of grammars used in deep linguistic processing has been increasing. In this paper ...
TOPLAS
2010
13 years 6 months ago
2010
program constraints are defined over a program’s abstract syntax tree. The JAVACOP compiler automatically enforces these constraints on programs during compilation. The JAVACOP ...