9842 search results - page 264 / 1969 » The Complexity of the Matching-Cut Problem |
82
Voted
ICIP
1997
IEEE
16 years 2 months ago
1997
IEEE
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
94
Voted
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
134
Voted
TIME
2003
IEEE
15 years 5 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
99
Voted
EUROGP
2001
Springer
15 years 5 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
104
Voted
IJCNN
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...