6562 search results - page 170 / 1313 » Noetherianity and Combination Problems |
146
click to vote
ICIP
2008
IEEE
16 years 22 days ago
2008
IEEE
In this paper we deal with the inpainting problem and with the problem of finding text in images. We first review many of the methods used for structure and texture inpaintings....
150
click to vote
AIPS
2006
15 years 7 months ago
2006
We investigate the problem of temporal planning with concurrent actions having stochastic durations, especially in the context of extended-state-space based planners. The problem ...
288
click to vote
ECOOP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. The expression families problem can be defined as the problem of achieving reusability and composability across the components involved in a family of related datatypes a...
144
click to vote
FIW
2009
15 years 4 months ago
2009
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...
187
click to vote
PAMI
2011
15 years 1 months ago
2011
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...