144 search results - page 13 / 29 » Solving Regular Tree Grammar Based Constraints |
CPAIOR
2007
Springer
15 years 5 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
AHS
2007
IEEE
15 years 6 months ago
2007
IEEE
Finite impulse response (FIR) structures are the most commonly used digital filters and can be found in various areas of everyday life. In this paper we introduce a novel approac...
KCAP
2005
ACM
15 years 5 months ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
CICLING
2010
Springer
15 years 2 months ago
2010
Springer
The translation quality and parsing efficiency are often disappointed when Rule based Machine Translation systems deal with long sentences. Due to the complicated syntactic structu...
116
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract We present the first method to handle curvature regularity in region-based image segmentation and inpainting that is independent of initialization. To this end we start f...