Sciweavers

144 search results - page 11 / 29
» Solving Regular Tree Grammar Based Constraints
Sort
View
ICASSP
2011
IEEE
14 years 3 months ago
Dual constrained TV-based regularization
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
Camille Couprie, Hugues Talbot, Jean-Christophe Pe...
JUCS
2006
141views more  JUCS 2006»
14 years 11 months ago
Constraint Based Methods for Biological Sequence Analysis
: The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for proce...
Maryam Bavarian, Verónica Dahl
CVPR
2009
IEEE
16 years 6 months ago
Unsupervised Maximum Margin Feature Selection with Manifold Regularization
Feature selection plays a fundamental role in many pattern recognition problems. However, most efforts have been focused on the supervised scenario, while unsupervised feature s...
Bin Zhao, James Tin-Yau Kwok, Fei Wang, Changshui ...
SCALESPACE
2007
Springer
15 years 5 months ago
Super-Resolution Using Sub-band Constrained Total Variation
Abstract. Super-resolution of a single image is a severely ill-posed problem in computer vision. It is possible to consider solving this problem by considering a total variation ba...
Priyam Chatterjee, Vinay P. Namboodiri, Subhasis C...
AAAI
1996
15 years 29 days ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati